LCF theorem prover
E230806
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
All labels observed (3)
| Label | Occurrences |
|---|---|
| LCF theorem prover canonical | 6 |
| LCF (Logic for Computable Functions) | 1 |
| Logic for Computable Functions theorem prover | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2092389 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: LCF theorem prover Context triple: [Robin Milner, knownFor, LCF theorem prover]
-
A.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
B.
Knuth–Bendix completion algorithm
The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
-
C.
Gilles Dowek
Gilles Dowek is a French logician and computer scientist known for his influential work in proof theory, type systems, and automated deduction.
-
D.
LambdaProlog
LambdaProlog is a logic programming language that extends Prolog with higher-order features, polymorphism, and strong support for reasoning about formal systems and syntax with bindings.
-
E.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: LCF theorem prover Target entity description: The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
-
A.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
B.
Knuth–Bendix completion algorithm
The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
-
C.
Gilles Dowek
Gilles Dowek is a French logician and computer scientist known for his influential work in proof theory, type systems, and automated deduction.
-
D.
LambdaProlog
LambdaProlog is a logic programming language that extends Prolog with higher-order features, polymorphism, and strong support for reasoning about formal systems and syntax with bindings.
-
E.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
- F. None of above. chosen
Statements (43)
| Predicate | Object |
|---|---|
| instanceOf |
interactive theorem prover
ⓘ
proof assistant ⓘ software system ⓘ |
| basedOn | higher-order logic ⓘ |
| category | computer-assisted proof system ⓘ |
| conceptualBasisFor |
HOL theorem prover family
ⓘ
linked to:
HOL theorem prover
Isabelle logical framework ⓘ |
| contributedTo | development of ML ⓘ |
| designedBy | Robin Milner ⓘ |
| developedAt | University of Edinburgh ⓘ |
| ensures | soundness via abstract data types ⓘ |
| era | 1970s ⓘ |
| field |
automated reasoning
ⓘ
formal methods ⓘ mathematical logic ⓘ |
| fullName |
Logic for Computable Functions theorem prover
ⓘ
linked to:
LCF theorem prover
|
| hasAbbreviation | LCF ⓘ |
| hasArchitectureStyle | LCF-style architecture ⓘ |
| hasCoreComponent |
logical inference kernel
ⓘ
tactic mechanism ⓘ theorem abstract type ⓘ |
| hasDesignGoal |
machine-assisted formal proof
ⓘ
reliable proof checking ⓘ |
| hasDesignPrinciple |
separation of logic kernel and tactics
ⓘ
soundness by construction ⓘ |
| hasKeyConcept |
abstract data types for theorems
ⓘ
small trusted kernel ⓘ user-level proof tactics ⓘ |
| implementedIn | ML ⓘ |
| influenced |
HOL theorem provers
ⓘ
linked to:
HOL theorem prover
Isabelle theorem prover ⓘ
linked to:
Isabelle proof assistant
ML programming language design ⓘ |
| isEarlyExampleOf | interactive proof system ⓘ |
| notableFor |
inspiring later LCF-style provers
ⓘ
introduction of tactic-based proof construction ⓘ pioneering higher-order logic in interactive provers ⓘ |
| pioneered | LCF-style architecture ⓘ |
| relatedTo |
HOL Light
ⓘ
HOL4 ⓘ Isabelle/HOL ⓘ
linked to:
Isabelle proof assistant
|
| supports |
interactive proof development
ⓘ
user-defined proof strategies ⓘ |
| usesLogic | higher-order logic ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: LCF theorem prover Description of subject: The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
Referenced by (8)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: LCF theorem prover
subject linked to:
Arthur
subject linked to:
Hope programming language
linked to: LCF theorem prover