ats2-lang 0.2.3-1 source package in Ubuntu
Changelog
ats2-lang (0.2.3-1) unstable; urgency=medium * New upstream release -- Matthew Danish <email address hidden> Mon, 28 Sep 2015 13:16:32 +0100
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.3-1.dsc | 1.7 KiB | 53a301591c564ee4abdeb03c81debe3e75e567cced44e1eada1c1c44136941a8 |
ats2-lang_0.2.3.orig.tar.gz | 3.2 MiB | a2a50305ddfc8c88d475e0378a9f476887d11c0a64f381b849f2b9f1746258cd |
ats2-lang_0.2.3-1.debian.tar.xz | 5.9 KiB | 3c3c63143db4fbb5967a24c1f72eee9626848fc16f3f4bb2a0c1c8af7350a52f |
Available diffs
- diff from 0.2.1-1 to 0.2.3-1 (1.9 MiB)
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.