Difference between revisions of "Applications and libraries/Theorem provers"

From HaskellWiki
Jump to navigation Jump to search
(+ agda)
 
(+ djinn)
Line 2: Line 2:
   
 
* [http://www.cs.chalmers.se/~catarina/agda/ 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.
  
* [http://www.cs.chalmers.se/~catarina/agda/ 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.
  +
  +
* [http://darcs.augustsson.net/Darcs/Djinn Djinn] generates Haskell code * from a type declaration, using a decision procedure from intuitionistic propositional calculus.

Revision as of 04:47, 25 March 2006

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.
  • Djinn generates Haskell code * from a type declaration, using a decision procedure from intuitionistic propositional calculus.
Retrieved from "https://wiki.haskell.org/index.php?title=Applications_and_libraries/Theorem_provers&oldid=3274"