Difference between revisions of "Applications and libraries/Theorem provers"
Jump to navigation
Jump to search
DonStewart (talk | contribs) (+ djinn) |
EndreyMark (talk | contribs) (Adding two links: ,,Paradox'' and ,,Dumatel'') |
||
| Line 4: | Line 4: | ||
* [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. |
||
| + | |||
| + | * [http://www.math.chalmers.se/~koen/paradox/ Paradox] ”processes first-order logic problems and tries to find finite-domain models for them”. |
||
| + | |||
| + | * [http://www.haskell.org/dumatel/ Dumatel] “is a prover based on many-sorted term rewriting (TRW) and equational reasoning” |
||
Revision as of 19:26, 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”