# Applications and libraries/Theorem provers

### From HaskellWiki

< Applications and libraries(Difference between revisions)

DonStewart (Talk | contribs) (+Camila) |
EndreyMark (Talk | contribs) (Adding link to the new Analysis and design page from the description of Camila) |
||

Line 9: | Line 9: | ||

* [http://www.haskell.org/dumatel/ Dumatel] is a prover based on many-sorted term rewriting (TRW) and equational reasoning | * [http://www.haskell.org/dumatel/ Dumatel] is a prover based on many-sorted term rewriting (TRW) and equational reasoning | ||

− | * [http://wiki.di.uminho.pt/wiki/bin/view/PURe/Camila Camila] is a system for software development using formal methods | + | * [http://wiki.di.uminho.pt/wiki/bin/view/PURe/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. |

## Revision as of 08:21, 29 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

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