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.

All labels observed (1)

Label Occurrences
LCF canonical 2

How this entity was disambiguated

Statements (46)

Predicate Object
instanceOf interactive theorem prover ⓘ
metalanguage ⓘ
theorem-proving framework ⓘ
basedOn Scott domain theory ⓘ
typed lambda calculus ⓘ
contributor Lockwood Morris ⓘ
Malcolm Newey ⓘ
Mike Gordon ⓘ
others at University of Edinburgh ⓘ
coreLogic intuitionistic higher-order logic ⓘ
countryOfOrigin United Kingdom ⓘ
designer Robin Milner ⓘ
developedAt University of Edinburgh ⓘ
field automated theorem proving ⓘ
computer science ⓘ
formal methods ⓘ
mathematical logic ⓘ
fullName Logic for Computable Functions ⓘ
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 ⓘ
HOL Light ⓘ
HOL theorem provers ⓘ
linked to: HOL theorem prover

HOL4 ⓘ
HOL88 ⓘ
Isabelle ⓘ
ML programming language ⓘ
Standard ML ⓘ
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 ⓘ

How these facts were elicited

Referenced by (2)

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