Ubuntu
ats-lang-anairiats package

ats-lang-anairiats 0.2.11-1build1 source package in Ubuntu

Changelog

ats-lang-anairiats (0.2.11-1build1) bionic; urgency=high

  * No change rebuild to pick up -fPIE compiler default

 -- Balint Reczey <email address hidden>  Tue, 03 Apr 2018 12:13:36 +0000

Upload details

Uploaded by:
Balint Reczey
Uploaded to:
Bionic
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
devel
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section
Focal release universe devel
Bionic release universe devel

Downloads

File Size SHA-256 Checksum
ats-lang-anairiats_0.2.11.orig.tar.gz 2.6 MiB d74922ef36f375f41d69dd33a243f414f182560c93cb1a12260a425552318622
ats-lang-anairiats_0.2.11-1build1.debian.tar.xz 15.5 KiB 6afbfce40b0c7345701b95d288a5cfb5027ead89c44994c60f14ee60b0eefdc3
ats-lang-anairiats_0.2.11-1build1.dsc 2.2 KiB 6be0c3d0c9ea8ead674c5e60535d8eda145553e3108114a23fa60f2342d74e63

View changes file

Binary packages built by this source

ats-lang-anairiats: No summary available for ats-lang-anairiats in ubuntu eoan.

No description available for ats-lang-anairiats in ubuntu eoan.

ats-lang-anairiats-dbgsym: No summary available for ats-lang-anairiats-dbgsym in ubuntu hirsute.

No description available for ats-lang-anairiats-dbgsym in ubuntu hirsute.

ats-lang-anairiats-doc: No summary available for ats-lang-anairiats-doc in ubuntu disco.

No description available for ats-lang-anairiats-doc in ubuntu disco.

ats-lang-anairiats-examples: Examples for the ATS compiler Anairiats

 ATS 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/Anairiats) is written in ATS 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 some examples of the language.