El directorio enciclopédico desde la Wikipedia.
Agda is a proof assistant, i.e. a computer program that can check mathematical proofs. More specifically, it is an interactive system for developing constructive proofs in a variant of Per Martin-Löf's Type Theory. It can also be seen as a functional programming language with dependent types and was developed by Ulf Norell, a post-doc at Chalmers University of Technology. Agda is based on the idea of direct manipulation of proof-term and not on tactics. The proof is a term, not a script. The language has ordinary programming constructs such as data-types and case-expressions, signatures and records, let-expressions and modules. The system has an Emacs interface and a graphical interface, Alfa. [edit] Agda 2The second version of Agda, Agda 2, is currently being developed at Chalmers by Ulf Norell. The syntax has completely changed from Agda 1 (though some conversion tools are being developed as well), introducing for instance implicit variables, that can be omitted when deducible from the context. Agda 2 also makes an intensive use of Unicode as a way to obtain easily-readable proofs. Agda 2 provides either a commandline tool or a powerful Emacs mode, developed by Makoto Takeyama and Nils Anders Danielsson. The 7th Agda Implementor's Meeting was held in Osaka in November 2007. AIM8 is scheduled for May in Gothenburg. Agda 2 is very close to Epigram. [edit] References
[edit] External links
Directorio de Enlaces Directorio dmoz Directorio espejo dmoz Pedro Bernardo |