Isar proof language
E822910
The Isar proof language is a human-readable, structured language for writing formal proofs within the Isabelle/HOL proof assistant.
All labels observed (4)
| Label | Occurrences |
|---|---|
| Isabelle/Isar | 2 |
| Isar proof language canonical | 2 |
| Isabelle/HOL proof language | 1 |
| Isabelle/Isar – A Versatile Environment for Human-Readable Formal Proof Documents | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9810119 — 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: Isar proof language Context triple: [Isabelle/HOL: A Proof Assistant for Higher-Order Logic, describes, Isar proof language]
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
HOL theorem prover
The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
-
E.
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.
- 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: Isar proof language Target entity description: The Isar proof language is a human-readable, structured language for writing formal proofs within the Isabelle/HOL proof assistant.
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
HOL theorem prover
The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
-
E.
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.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
component of Isabelle
ⓘ
component of Isabelle/HOL ⓘ proof language ⓘ structured proof language ⓘ |
| basedOn | Isabelle logical framework NERFINISHED ⓘ |
| contrastsWith | tactic-style proof scripts ⓘ |
| designedFor |
Isabelle proof assistant
NERFINISHED
ⓘ
Isabelle/HOL NERFINISHED ⓘ |
| documentation |
Isabelle/HOL tutorial
ⓘ
Isabelle/Isar Reference Manual NERFINISHED ⓘ |
| executionEnvironment |
Isabelle command-line interface
NERFINISHED
ⓘ
Isabelle/jEdit NERFINISHED ⓘ |
| fullName | Isar proof language NERFINISHED ⓘ |
| hasFeature |
document-oriented proofs
ⓘ
explicit proof context management ⓘ forward and backward reasoning ⓘ integration with automated tactics ⓘ locales ⓘ named assumptions ⓘ named facts ⓘ proof by cases ⓘ proof by induction ⓘ structured calculational reasoning ⓘ structured proof blocks ⓘ support for nested proofs ⓘ support for proof refinement ⓘ support for proof scripts ⓘ |
| hasGoal |
bridge human-readable and machine-checked proofs
ⓘ
improve readability of formal proofs ⓘ support maintainable large proof developments ⓘ |
| hasSyntaxStyle |
block-structured
ⓘ
declarative ⓘ |
| integratedWith |
Isabelle proof document model
NERFINISHED
ⓘ
Isabelle/Isar environment NERFINISHED ⓘ |
| shortName | Isar NERFINISHED ⓘ |
| supports |
declarative proofs
ⓘ
human-readable proofs ⓘ machine-checked proofs ⓘ structured proofs ⓘ |
| supportsConcept |
proof context
ⓘ
structured reasoning steps ⓘ theory development ⓘ |
| typicalDomain |
Isabelle/HOL theories
NERFINISHED
ⓘ
higher-order logic ⓘ |
| usedIn |
formal methods research
ⓘ
formal verification ⓘ formalization of mathematics ⓘ interactive 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: Isar proof language Description of subject: The Isar proof language is a human-readable, structured language for writing formal proofs within the Isabelle/HOL proof assistant.
Referenced by (6)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Isabelle/HOL proof language
this entity surface form:
Isabelle/Isar
this entity surface form:
Isabelle/Isar – A Versatile Environment for Human-Readable Formal Proof Documents
this entity surface form:
Isabelle/Isar