Slide 8
Slide 8 text
Automated theorem provers
8
Name Developer(s)
Implementation
language
Features
Higher-orde
r logic
Dependent
types
Proof
automation
Code
generation
ACL2 Matt Kaufmann and J Strother Moore Common Lisp No Untyped Yes Executable
Agda Ulf Norell, Nils Anders Danielsson, and
Andreas Abel (Chalmers and Gothenburg)
Haskell
Yes Yes No
Already
executable
Coq INRIA OCaml Yes Yes Yes Yes
F* Microsoft Research and INRIA F* Yes Yes Yes Yes
HOL Light John Harrison OCaml Yes No Yes No
HOL4 Michael Norrish, Konrad Slind, and others Standard ML Yes No Yes Yes
Isabelle Larry Paulson (Cambridge), Tobias Nipkow
(München) and Makarius Wenzel
Standard ML,
Scala
Yes No Yes Yes
Lean Microsoft Research C++ Yes Yes Yes Un known
LEGO Randy Pollack (Edinburgh) Standard ML Yes Yes No No
Mizar Białystok University Free Pascal Partial Yes No No
NuPRL Cornell University Common Lisp Yes Yes Yes Yes
PVS SRI International Common Lisp Yes Yes Yes Un known