HOL4
E807605
HOL4 is an interactive theorem prover for higher-order logic, widely used in formal verification and based on the LCF approach to ensuring soundness.
All labels observed (1)
| Label | Occurrences |
|---|---|
| HOL4 canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9566790 — 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: HOL4 Context triple: [LCF theorem prover, relatedTo, HOL4]
-
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 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.
-
D.
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.
-
E.
Twelf
Twelf is a logical framework and meta-logical tool used for specifying, implementing, and proving properties of deductive systems such as programming languages and logics.
- 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: HOL4 Target entity description: HOL4 is an interactive theorem prover for higher-order logic, widely used in formal verification and based on the LCF approach to ensuring soundness.
-
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 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.
-
D.
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.
-
E.
Twelf
Twelf is a logical framework and meta-logical tool used for specifying, implementing, and proving properties of deductive systems such as programming languages and logics.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
LCF-style theorem prover
ⓘ
interactive theorem prover ⓘ proof assistant ⓘ theorem prover ⓘ |
| basedOn | LCF approach ⓘ |
| domain |
computer-aided verification
ⓘ
formal methods ⓘ formal verification ⓘ |
| ensures | soundness via small trusted kernel ⓘ |
| hasFeature |
LCF-style abstract data type for theorems
ⓘ
co-inductive definitions ⓘ datatype package ⓘ decision procedures ⓘ export of proofs or theorems ⓘ extensible libraries ⓘ inductive definitions ⓘ interactive proof shell ⓘ proof recording and replay ⓘ proof tacticals ⓘ proof tactics ⓘ record package ⓘ rewriting engine ⓘ small trusted kernel ⓘ support for large-scale verification projects ⓘ theory management system ⓘ |
| hasKernelLanguage | Standard ML NERFINISHED ⓘ |
| hasProgrammingLanguage | Standard ML NERFINISHED ⓘ |
| hasProperty |
LCF-style soundness guarantee
ⓘ
extensible via ML programming ⓘ higher-order logic as object logic ⓘ trusted kernel with untrusted automation ⓘ |
| implementedIn | Standard ML NERFINISHED ⓘ |
| partOf | HOL family of theorem provers NERFINISHED ⓘ |
| relatedTo |
HOL Light
NERFINISHED
ⓘ
HOL theorem prover family NERFINISHED ⓘ Isabelle/HOL NERFINISHED ⓘ |
| supports |
formal verification
ⓘ
interactive proof development ⓘ machine-checked proofs ⓘ mechanized reasoning ⓘ proof automation ⓘ tactic-based proof construction ⓘ |
| supportsLogic | higher-order logic ⓘ |
| usedFor |
hardware verification
ⓘ
mathematics formalization ⓘ protocol verification ⓘ software verification ⓘ |
| usedIn |
formal methods research
ⓘ
industrial verification projects ⓘ |
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: HOL4 Description of subject: HOL4 is an interactive theorem prover for higher-order logic, widely used in formal verification and based on the LCF approach to ensuring soundness.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.