How to Install and Uninstall ats-lang-anairiats-examples Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: November 25,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 20.10 (Groovy Gorilla)

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

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

This is a short guide on how to uninstall ats-lang-anairiats-examples on Ubuntu 20.10 (Groovy Gorilla):

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

3. Information about the ats-lang-anairiats-examples package on Ubuntu 20.10 (Groovy Gorilla)

Package: ats-lang-anairiats-examples
Architecture: all
Version: 0.2.11-1build1
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-1build1_all.deb
Size: 250560
MD5sum: 4f7f537c4fbd42b0527fa47fdc45c136
SHA1: 8b6fc700db564a2868c20eb980a4f7c456facc46
SHA256: c955971be88fa060442a867117c79882fdee79e0e5bb278a4d6baaf8c2cb5645
SHA512: 92644703f58a4d5e6257c55c33f67e432427529c16715e8591dee802fd5f9b9508c77b53f5b7ddd07b26b0801394503149262594cc17546edbf9a3dccc810540
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