LCF (theorem prover)
From Wikipedia, the free encyclopedia
LCF (Logic for Computable Functions) is an interactive automated theorem prover developed at the universities of Edinburgh and Stanford by Robin Milner and others. LCF introduced the general purpose programming language ML to allow users to write theorem proving tactics. Theorems in the system are propositions of a special "theorem" abstract datatype. The ML type system ensures that theorems are derived using only the inference rules given by the operations of the abstract type.
Successors include HOL and Isabelle.
[edit] References
- Gordon, Michael J. C. (1996). From LCF to HOL: a short history. Retrieved on 2007-10-11.
 |
This logic-related article is a stub. You can help by expanding it. |
