Applications and libraries/Theorem provers

From HaskellWiki
< Applications and libraries
Revision as of 03:39, 25 March 2006 by DonStewart (talk | contribs) (+ agda)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Theorem provers

  • Agda is a system for incrementally developing proofs and programs. Agda is also a functional language with dependent types. This language is very similar to cayenne and agda is intended to be a (almost) full implementation of it in the future.