Logic for Computable Functions

This is an old revision of this page, as edited by Michaeln (talk | contribs) at 04:46, 2 October 2003 (Rewording, and mention that some development took place at Stanford as well as Edinburgh). 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 type. The ML type system ensures that theorems are derived using only sound inference rules.

Successors include the HOL and Isabelle theorem provers.