# Applications and libraries/Theorem provers

### From HaskellWiki

< Applications and libraries(Difference between revisions)

(Reformatted as a definition list to fit in with the other libraries and tools pages.) |
DonStewart (Talk | contribs) m (typo only) |
||

Line 5: | Line 5: | ||

;[http://darcs.augustsson.net/Darcs/Djinn Djinn] |
;[http://darcs.augustsson.net/Darcs/Djinn Djinn] |
||

− | :Djinn generates Haskell code * from a type declaration, using a decision procedure from intuitionistic propositional calculus. |
+ | :Djinn generates Haskell code from a type declaration, using a decision procedure from intuitionistic propositional calculus. |

;[http://www.math.chalmers.se/~koen/paradox/ Paradox] |
;[http://www.math.chalmers.se/~koen/paradox/ Paradox] |

## Revision as of 14:34, 30 March 2006

## Theorem provers

- 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.

- Djinn
- Djinn generates Haskell code from a type declaration, using a decision procedure from intuitionistic propositional calculus.

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

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

- Camila
- Camila is a system for software development using formal methods. Other materials on formal methods can be found also on Analysis and design page.