![]() ![]() Prototype Verification System (PVS) – a proof language and system based on higher-order logic. ![]() PhoX – A proof assistant based on higher-order logic which is eXtensible.Mizar – A proof assistant based on first-order logic, in a natural deduction style, and Tarski–Grothendieck set theory.MINLOG – A proof assistant based on first-order minimal logic.Matita – A light system based on the Calculus of Inductive Constructions.The main code-base is BSD-licensed, but the Isabelle distribution bundles many add-on tools with different licenses. Isabelle is an interactive theorem prover, successor of HOL.IMPS, An Interactive Mathematical Proof System.ProofPower – Went proprietary, then returned to open source.HOL Light – A thriving "minimalist fork".HOL4 – The "primary descendant", still under active development.Strategy composition gives users the ability to produce significant proofs with relatively few interactions with the system. Theorems represent new elements of the language and can only be introduced via "strategies" which guarantee logical correctness. In these systems the logical core is a library of their programming language. HOL theorem provers – A family of tools ultimately derived from the LCF theorem prover.Coq – Allows the expression of mathematical assertions, mechanically checks proofs of these assertions, helps to find formal proofs, and extracts a certified program from the constructive proof of its formal specification.ACL2 – a programming language, a first-order logical theory, and a theorem prover (with both interactive and automatic modes) in the Boyer–Moore tradition.Larry Paulson ( Cambridge), Tobias Nipkow ( München) and Makarius Wenzel Michael Norrish, Konrad Slind, and others Ulf Norell, Nils Anders Danielsson, and Andreas Abel ( Chalmers and Gothenburg) See also: Dependent type § Comparison, and Automated theorem proving § Comparison Name
0 Comments
Leave a Reply. |