ats2-lang 0.2.4-1 source package in Ubuntu
Changelog
ats2-lang (0.2.4-1) unstable; urgency=medium * New upstream release -- Matthew Danish <email address hidden> Fri, 30 Oct 2015 13:36:46 +0000
Upload details
- Uploaded by:
- Matthew Danish
- Uploaded to:
- Sid
- Original maintainer:
- Matthew Danish
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| ats2-lang_0.2.4-1.dsc | 1.7 KiB | 2e17cc6ef4e0741e8b0a741a935da3b8bd348785ce30cc7c43a2530e34911116 |
| ats2-lang_0.2.4.orig.tar.gz | 3.2 MiB | 9e6d5779f65c05e21a1088cce413a517011834ad8c7650b11a32abdab7c8a337 |
| ats2-lang_0.2.4-1.debian.tar.xz | 5.8 KiB | 3827f7c268cd23198315877fea5d904e20cc5ed107fae5099162409f307e9002 |
Available diffs
- diff from 0.2.3-1 to 0.2.4-1 (267.0 KiB)
No changes file available.
Binary packages built by this source
- ats2-lang: ATS version 2 programming language compiler
ATS2 a.k.a. ATS/Postiats is a programming language with a highly expressive
type system rooted in the framework Applied Type System. In particular, both
dependent types and linear types are available in ATS. The current
implementation of ATS (ATS/Postiats) is written in ATS (ATS/Anairiats) itself.
It can be as efficient as C/C++ and supports a variety of programming
paradigms.
.
In addition, ATS contains a component ATS/LF that supports a form of
(interactive) theorem proving, where proofs are constructed as total
functions. With this component, ATS advocates a programming style
that combines programming with theorem proving. Furthermore, this
component may be used as a logical framework to encode various
deduction systems and their (meta-)properties.
.
This package contains the compiler patsopt and the frontend patscc, as well as
the emacs mode for the language.
- ats2-lang-dbgsym: debug symbols for package ats2-lang
ATS2 a.k.a. ATS/Postiats is a programming language with a highly expressive
type system rooted in the framework Applied Type System. In particular, both
dependent types and linear types are available in ATS. The current
implementation of ATS (ATS/Postiats) is written in ATS (ATS/Anairiats) itself.
It can be as efficient as C/C++ and supports a variety of programming
paradigms.
.
In addition, ATS contains a component ATS/LF that supports a form of
(interactive) theorem proving, where proofs are constructed as total
functions. With this component, ATS advocates a programming style
that combines programming with theorem proving. Furthermore, this
component may be used as a logical framework to encode various
deduction systems and their (meta-)properties.
.
This package contains the compiler patsopt and the frontend patscc, as well as
the emacs mode for the language.
