# Applications and libraries/Theorem provers

### From HaskellWiki

< Applications and libraries(Difference between revisions)

EndreyMark (Talk | contribs) (Adding Ivor also to here) |
DonStewart (Talk | contribs) (fmt) |
||

Line 1: | Line 1: | ||

− | |||

Tools for formal reasoning, written in Haskell. | Tools for formal reasoning, written in Haskell. | ||

+ | |||

+ | == Applications == | ||

;[http://www.cs.chalmers.se/~catarina/agda/ Agda] | ;[http://www.cs.chalmers.se/~catarina/agda/ Agda] | ||

Line 23: | Line 24: | ||

;[http://www.cs.chalmers.se/~augustss/cayenne/index.html Cayenne] | ;[http://www.cs.chalmers.se/~augustss/cayenne/index.html Cayenne] | ||

:Cayenne is a functional language with a powerful [[Dependent type|dependent type system]]. The basic types are functions, products, and sums. Functions and products use dependent types to gain additional power. As with Epigram, a dependently typed language may be used to encode strong proofs in the type system. | :Cayenne is a functional language with a powerful [[Dependent type|dependent type system]]. The basic types are functions, products, and sums. Functions and products use dependent types to gain additional power. As with Epigram, a dependently typed language may be used to encode strong proofs in the type system. | ||

− | |||

− | |||

− | |||

;[http://www.haskell.org/yarrow/ Yarrow] | ;[http://www.haskell.org/yarrow/ Yarrow] | ||

Line 47: | Line 45: | ||

;[http://citeseer.ist.psu.edu/29367.html A resolution-based theorem prover for FOL] | ;[http://citeseer.ist.psu.edu/29367.html A resolution-based theorem prover for FOL] | ||

:Haskell implementation of a resolution based theorem prover for first order logic. | :Haskell implementation of a resolution based theorem prover for first order logic. | ||

+ | |||

+ | == Libraries == | ||

+ | |||

+ | ;[http://www.dcs.st-and.ac.uk/~eb/ivor.php Ivor] | ||

+ | :is type theory based theorem proving library -- written by [http://www.dcs.st-and.ac.uk/~eb/index.php Edwin Brady] (see also the author's homepage, there are a lot of materials concerning [[dependent type]] theory there). | ||

+ | |||

+ | {{LibrariesPage}} |

## Revision as of 02:49, 6 December 2006

Tools for formal reasoning, written in Haskell.

## 1 Applications

- 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 the analysis and design page.

- Epigram
- Epigram is a prototype dependently typed functional programming language, equipped with an interactive editing and typechecking environment. High-level Epigram source code elaborates into a dependent type theory based on Zhaohui Luo's UTT. Programming with evidence lies at the heart of Epigram's design.

- Cayenne
- Cayenne is a functional language with a powerful dependent type system. The basic types are functions, products, and sums. Functions and products use dependent types to gain additional power. As with Epigram, a dependently typed language may be used to encode strong proofs in the type system.

- Yarrow
- Yarrow is a proof-assistant for Pure Type Systems (PTSs) with several extensions. In Yarrow you can experiment with various pure type systems, representing different logics and programming languages.

- Proof General Kit
- The Proof General Kit designs and implements a component-based framework for interactive theorem proving. The central middleware of the toolkit is implemented in Haskell. The project is the sucessor of the highly successful Emacs-based Proof General interface.

- Expander2
- Expander2 is a flexible multi-purpose workbench for rewriting, verification, constraint solving, flow graph analysis and related procedures that build up proofs or computation sequences. Moreover, tailor-made interpreters display terms as 2D structures ranging from trees and rooted graphs to tables, fractals and other turtle-system-generated pictures.

- DEMO
- Model checking for dynamic epistemic logic. DEMO is a tool for modelling change in epistemic logic (the logic of knowledge). Among other things, DEMO allows modeling epistemic updates, graphical display of update results, graphical display of action models, formula evaluation in epistemic models, translation of dynamic epistemic formulas to PDL (propositional dynamic logic) formulas. More materials and other Haskell resources on dynamic epistemic modelling (and more generally on logic and linguistics) can be found on Jan van Eijck's page.

- Equinox
- Equinox is a new theorem prover for pure first-order logic with equality. It finds ground proofs of the input theory, by solving successive ground instantiations of the theory using an incremental SAT-solver. Equality is dealt with using a Nelson-Oppen framework.

- FOL Resolution Theorem Prover
- An implementation of a simple theorem prover in first-order logic using Haskell.

- A resolution-based theorem prover for FOL
- Haskell implementation of a resolution based theorem prover for first order logic.

## 2 Libraries

- Ivor
- is type theory based theorem proving library -- written by Edwin Brady (see also the author's homepage, there are a lot of materials concerning dependent type theory there).

*This page contains a list of libraries and tools in a certain category. For a comprehensive list of such pages, see Applications and libraries.*