Isabelle/HOL: A Proof Assistant for Higher-Order Logic
E238246
"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.
All labels observed (5)
| Label | Occurrences |
|---|---|
| Isabelle/HOL | 4 |
| Isabelle/HOL: A Proof Assistant for Higher-Order Logic canonical | 2 |
| Isabelle/HOL Tutorial | 1 |
| Isabelle/HOL system | 1 |
| Isabelle/HOL tutorial and reference manuals | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2139675 — 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: Isabelle/HOL: A Proof Assistant for Higher-Order Logic Context triple: [Tobias Nipkow, notableWork, Isabelle/HOL: A Proof Assistant for Higher-Order Logic]
-
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.
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.
-
C.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
-
D.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
-
E.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
- 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: Isabelle/HOL: A Proof Assistant for Higher-Order Logic Target entity description: "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.
-
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.
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.
-
C.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
-
D.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
-
E.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
system documentation ⓘ technical monograph ⓘ |
| about |
Isabelle/HOL
ⓘ
formal verification ⓘ higher-order logic ⓘ interactive theorem proving ⓘ |
| audience |
practitioners of formal verification
ⓘ
researchers in formal methods ⓘ students of computer science ⓘ |
| covers |
classical higher-order logic
ⓘ
datatype definitions in Isabelle/HOL ⓘ formal specification ⓘ formal verification techniques ⓘ higher-order logic reasoning ⓘ inductive definitions in Isabelle/HOL ⓘ proof automation in Isabelle/HOL ⓘ recursive function definitions in Isabelle/HOL ⓘ theory development in Isabelle/HOL ⓘ |
| describes |
Isabelle/HOL libraries
ⓘ
Isabelle/HOL proof language ⓘ
linked to:
Isar proof language
Isabelle/HOL system ⓘ Isar proof language ⓘ structured proofs in Isabelle/HOL ⓘ tactic-based proof methods in Isabelle/HOL ⓘ |
| field |
computer science
ⓘ
mathematics ⓘ |
| focusesOn |
HOL object logic
ⓘ
Isabelle proof assistant ⓘ |
| language | English ⓘ |
| purpose |
to document the Isabelle/HOL system and its use
ⓘ
to present the Isabelle/HOL interactive theorem prover ⓘ |
| relatedTo |
HOL theorem proving
ⓘ
Isabelle theorem prover ⓘ
linked to:
Isabelle proof assistant
formal methods ⓘ mechanized logic ⓘ |
| title | Isabelle/HOL: A Proof Assistant for Higher-Order Logic ⓘ |
| topic |
automation in higher-order logic
ⓘ
formal reasoning in computer science ⓘ formal reasoning in mathematics ⓘ interactive theorem proving environment ⓘ logical foundations of Isabelle/HOL ⓘ proof tactics and methods ⓘ |
| usedAs |
reference manual for Isabelle/HOL
ⓘ
tutorial for Isabelle/HOL users ⓘ |
| usedIn |
formal methods education
ⓘ
industrial formal verification projects ⓘ research on theorem proving ⓘ |
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: Isabelle/HOL: A Proof Assistant for Higher-Order Logic Description of subject: "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.
Referenced by (9)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Isabelle/HOL: A Proof Assistant for Higher-Order Logic
linked to: Isabelle/HOL: A Proof Assistant for Higher-Order Logic
subject linked to:
Isabelle proof assistant
linked to: Isabelle/HOL: A Proof Assistant for Higher-Order Logic
subject linked to:
Isabelle proof assistant
linked to: Isabelle/HOL: A Proof Assistant for Higher-Order Logic
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
→
title
→
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
ⓘ
linked to: Isabelle/HOL: A Proof Assistant for Higher-Order Logic
linked to: Isabelle/HOL: A Proof Assistant for Higher-Order Logic
linked to: Isabelle/HOL: A Proof Assistant for Higher-Order Logic