LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
sav08:lecture26 [2008/05/28 05:40]
vkuncak
sav08:lecture26 [2008/05/28 06:07]
vkuncak
Line 47: Line 47:
   * Logic and Computation:​ Interactive Proof with Cambridge LCF   * Logic and Computation:​ Interactive Proof with Cambridge LCF
  
-===== Overview of Interactive Provers =====+===== Some Interactive Provers =====
  
-HOL, Isabelle+[[http://​hol.sourceforge.net/​|HOL]] - use directly ML
  
-PVS decision procedures+[[http://​www.cl.cam.ac.uk/​~jrh13/​hol-light/|HOL Light]] - compact version, written in OCaml
  
-Coq, NuPRL more complex type theoryconstructive mathematics+[[http://​www.cl.cam.ac.uk/​research/​hvg/​Isabelle/​|Isabelle]] ​popularML part largely hidden
  
-ACL2 - emphasis on executable functions, quantifier-free statements, automated induction, pioneering industrial-scale case studies+[[http://​pvs.csl.sri.com/​|PVS]] - automation through decision procedures 
 + 
 +[[http://​coq.inria.fr/​|Coq]] - was less automated, now catching up; more complex logic 
 + 
 +[[http://​www.cs.cornell.edu/​Info/​Projects/​Nuprl/​|NuPRL]] - more complex type theory, constructive mathematics 
 + 
 +[[http://​www.cs.utexas.edu/​~moore/​acl2/​|ACL2]] - emphasis on executable functions, quantifier-free statements, automated induction, pioneering industrial-scale case studies