Logic for Computable Functions

This is an old revision of this page, as edited by Ascánder (talk | contribs) at 05:03, 8 September 2004 (--> es:). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

An interactive 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 the HOL and Isabelle theorem provers.