Difference between revisions of "Applications and libraries/Theorem provers"
From HaskellWiki
EndreyMark (talk  contribs) (Adding link to the new Analysis and design page from the description of Camila) 
(Reformatted as a definition list to fit in with the other libraries and tools pages.) 

Line 1:  Line 1:  
== Theorem provers == 
== Theorem provers == 

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

⚫  
−  +  ;[http://darcs.augustsson.net/Darcs/Djinn 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] 

+  :Paradox processes firstorder logic problems and tries to find finitedomain models for them. 

−  +  ;[http://www.haskell.org/dumatel/ Dumatel] 

+  : Dumatel is a prover based on manysorted term rewriting (TRW) and equational reasoning 

−  +  ;[http://wiki.di.uminho.pt/wiki/bin/view/PURe/Camila 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:49, 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 firstorder logic problems and tries to find finitedomain models for them.
 Dumatel
 Dumatel is a prover based on manysorted 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.