LCF

E807592

LCF (Logic for Computable Functions) is an early interactive theorem-proving framework and metalanguage that pioneered ideas later used in functional programming languages and proof assistants.

Try in SPARQL Jump to: Statements Referenced by

Statements (46)

Predicate Object
instanceOf interactive theorem prover
metalanguage
theorem-proving framework
basedOn Scott domain theory
typed lambda calculus
contributor Lockwood Morris NERFINISHED
Malcolm Newey NERFINISHED
Mike Gordon NERFINISHED
others at University of Edinburgh
coreLogic intuitionistic higher-order logic
countryOfOrigin United Kingdom
designer Robin Milner NERFINISHED
developedAt University of Edinburgh NERFINISHED
field automated theorem proving
computer science
formal methods
mathematical logic
fullName Logic for Computable Functions NERFINISHED
goal mechanization of mathematical proofs
reasoning about computable functions
hasPart LCF metalanguage
inference kernel
tactic mechanism
theory of computable functions
historicalSignificance one of the earliest interactive theorem provers
origin of the ML family of languages
pioneered ideas used in modern proof assistants
inception early 1970s
influenced Coq NERFINISHED
HOL Light NERFINISHED
HOL theorem provers NERFINISHED
HOL4 NERFINISHED
HOL88
Isabelle NERFINISHED
ML programming language
Standard ML NERFINISHED
functional programming language design
general design of proof assistants
notableIdea LCF-style architecture with abstract data type for theorems
tactics and tacticals for proof automation
use of a meta-language to script proofs
programmingParadigm functional
proofConstructionStyle interactive
safetyProperty only kernel can create theorems
supports user-defined proof tactics
verificationMethod small trusted kernel

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.