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 "Agda is a dependently typed functional programming language: It has inductive families, which are like Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterised modules, mixfix operators, Unicode characters, and an interactive Emacs interface (the type checker can assist in the development of your code). Agda is also a proof assistant: It is an interactive system for writing and checking proofs. Agda is based on intuitionistic type theory, a foundational system for constructive mathematics developed by the Swedish logician Per Martin-Löf. It has many similarities with other proof assistants based on dependent types, such as Coq, Epigram and NuPRL. This package provides a command-line program for type-checking and compiling Agda programs. The program can also generate hyperlinked, highlighted HTML files from Agda sources.". 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

    • Agda-executable  + (Agda is a dependently typed functional proAgda is a dependently typed functional programming language: It</br>has inductive families, which are like Haskell's GADTs, but they</br>can be indexed by values and not just types. It also has</br>parameterised modules, mixfix operators, Unicode characters, and</br>an interactive Emacs interface (the type checker can assist in</br>the development of your code).</br></br>Agda is also a proof assistant: It is an interactive system for</br>writing and checking proofs. Agda is based on intuitionistic type</br>theory, a foundational system for constructive mathematics</br>developed by the Swedish logician Per Martin-Löf. It has many</br>similarities with other proof assistants based on dependent</br>types, such as Coq, Epigram and NuPRL.</br></br>This package provides a command-line program for type-checking</br>and compiling Agda programs. The program can also generate</br>hyperlinked, highlighted HTML files from Agda sources. highlighted HTML files from Agda sources.)


    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.