# Applications and libraries/Theorem provers

### From HaskellWiki

< Applications and libraries(Difference between revisions)

EndreyMark (Talk | contribs) (Adding two links: ,,Paradox'' and ,,Dumatel'') |
EndreyMark (Talk | contribs) m (The description of Agda mentioned dependent types, so I made a link to Dependent types wikipage.) |
||

Line 1: | Line 1: | ||

== Theorem provers == | == Theorem provers == | ||

− | * [http://www.cs.chalmers.se/~catarina/agda/ Agda] is a system for incrementally developing proofs and programs. Agda is also a functional language with | + | * [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 type]]s. 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. | * [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 19:31, 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.

- Paradox ”processes first-order logic problems and tries to find finite-domain models for them”.

- Dumatel “is a prover based on many-sorted term rewriting (TRW) and equational reasoning”