HOL theorem prover
E807591
The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
All labels observed (6)
| Label | Occurrences |
|---|---|
| HOL family of theorem provers | 3 |
| HOL theorem prover family | 3 |
| HOL theorem provers | 3 |
| HOL theorem prover canonical | 2 |
| Flyspeck project | 1 |
| ProofPower-HOL | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9566623 — 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: HOL theorem prover Context triple: [Arthur John Robin Gorell Milner, notableWork, HOL theorem prover]
-
A.
LCF theorem prover
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.
-
B.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
C.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
D.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
E.
ACL2 theorem proving system
The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
- 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: HOL theorem prover Target entity description: The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
-
A.
LCF theorem prover
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.
-
B.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
C.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
D.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
E.
ACL2 theorem proving system
The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
higher-order logic theorem prover
ⓘ
interactive theorem prover ⓘ proof assistant ⓘ |
| basedOn | classical higher-order logic ⓘ |
| belongsTo |
HOL family of theorem provers
ⓘ
linked to:
HOL theorem prover
|
| developedAt |
University of Cambridge
ⓘ
linked to:
Cambridge University
|
| developedFrom | LCF theorem prover ⓘ |
| hasApplicationDomain |
floating-point hardware verification
ⓘ
microprocessor verification ⓘ protocol verification ⓘ security-critical software verification ⓘ |
| hasConcept |
derived inference rules
ⓘ
tactics and tacticals ⓘ theory hierarchy ⓘ |
| hasFeature |
LCF-style architecture
ⓘ
ML programming interface ⓘ interactive proof development ⓘ small trusted kernel ⓘ tactic-based proof construction ⓘ |
| hasGoal | increasing assurance in critical systems ⓘ |
| hasProperty |
extensible via ML programming
ⓘ
soundness guaranteed by small kernel ⓘ |
| implementedIn | ML ⓘ |
| influenced |
HOL Light
ⓘ
HOL family of theorem provers ⓘ
linked to:
HOL theorem prover
HOL4 ⓘ Isabelle/HOL ⓘ ProofPower-HOL ⓘ
linked to:
HOL theorem prover
|
| relatedTo |
ACL2
ⓘ
linked to:
ACL2 theorem proving system
Coq ⓘ Isabelle ⓘ PVS ⓘ |
| supports |
datatype definition
ⓘ
higher-order logic ⓘ inductive definitions ⓘ mechanized proof checking ⓘ proof automation via tactics ⓘ theory definition ⓘ |
| usedBy |
formal methods researchers
ⓘ
hardware verification engineers ⓘ software verification engineers ⓘ |
| usedFor |
formal verification
ⓘ
formalization of mathematics ⓘ hardware verification ⓘ software verification ⓘ |
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: HOL theorem prover Description of subject: The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
Referenced by (13)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: HOL theorem prover
linked to: HOL theorem prover
linked to: HOL theorem prover
linked to: HOL theorem prover
linked to: HOL theorem prover
linked to: HOL theorem prover
linked to: HOL theorem prover
linked to: HOL theorem prover
linked to: HOL theorem prover