How to Install and Uninstall ats-lang-anairiats-examples Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 07,2024

1. Install "ats-lang-anairiats-examples" package

Here is a brief guide to show you how to install ats-lang-anairiats-examples on Ubuntu 21.04 (Hirsute Hippo)

$ sudo apt update $ sudo apt install ats-lang-anairiats-examples

2. Uninstall "ats-lang-anairiats-examples" package

Here is a brief guide to show you how to uninstall ats-lang-anairiats-examples on Ubuntu 21.04 (Hirsute Hippo):

$ sudo apt remove ats-lang-anairiats-examples $ sudo apt autoclean && sudo apt autoremove

3. Information about the ats-lang-anairiats-examples package on Ubuntu 21.04 (Hirsute Hippo)

Package: ats-lang-anairiats-examples
Architecture: all
Version: 0.2.11-1.1
Priority: optional
Section: universe/devel
Source: ats-lang-anairiats
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Matthew Danish
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 700
Recommends: ats-lang-anairiats
Filename: pool/universe/a/ats-lang-anairiats/ats-lang-anairiats-examples_0.2.11-1.1_all.deb
Size: 250576
MD5sum: 4c59ace0fbcee19458b96217c6222965
SHA1: 26a3e4d37285e3aeb4341870ebabbc2c43a72c12
SHA256: c0f1ac2157cafaf286978f597fde8b063a3579190ad84a8674b5d5f83c879f61
SHA512: 1c60ba62f733da40d858b13d7552053451f478dc5f22b71d3a1ad9c1b0bf94b1cab5522be0bc81b5a0639f0c6e3c57d77a767721eaf1f0c2d050fd87c7f05733
Homepage: http://www.ats-lang.org
Description-en: 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.
Description-md5: 3ca187940cc8bab1dca4d073f07d6399