Search by property

Jump to: navigation, search

This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.

Search by property

A list of all pages that have property "Full description" with value "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.". Since there have been only a few results, also nearby values are displayed.

Showing below up to 2 results starting with #1.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)


    

List of results

    • Ats2-lang  + (ATS2 a.k.a. ATS/Postiats is a programming ATS2 a.k.a. ATS/Postiats is a programming language with a highly</br>expressive type system rooted in the framework Applied Type</br>System. In particular, both dependent types and linear types are</br>available in ATS. The current implementation of ATS</br>(ATS/Postiats) is written in ATS (ATS/Anairiats) itself. It can</br>be as efficient as C/C++ and supports a variety of programming</br>paradigms.</br></br>In addition, ATS contains a component ATS/LF that supports a form</br>of (interactive) theorem proving, where proofs are constructed as</br>total functions. With this component, ATS advocates a programming</br>style that combines programming with theorem proving.</br>Furthermore, this component may be used as a logical framework to</br>encode various deduction systems and their (meta-)properties.</br></br>This package contains the compiler patsopt and the frontend</br>patscc. compiler patsopt and the frontend patscc.)


    Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.

    The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.