Isabelle proof assistant
E238245
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.
All labels observed (6)
| Label | Occurrences |
|---|---|
| Isabelle proof assistant canonical | 5 |
| Isabelle theorem prover | 4 |
| Isabelle/HOL | 3 |
| Isabelle (a generic logical framework) | 1 |
| Isabelle/Isar | 1 |
| Isar – A Generic Interpretative Approach to Readable Formal Proofs | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2139663 — 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 proof assistant Context triple: [Tobias Nipkow, knownFor, Isabelle proof assistant]
-
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.
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.
-
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.
Gilles Dowek
Gilles Dowek is a French logician and computer scientist known for his influential work in proof theory, type systems, and automated deduction.
- 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 proof assistant Target entity description: 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.
-
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.
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.
-
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.
Gilles Dowek
Gilles Dowek is a French logician and computer scientist known for his influential work in proof theory, type systems, and automated deduction.
- F. None of above. chosen
Statements (62)
| Predicate | Object |
|---|---|
| instanceOf |
formal methods tool
ⓘ
higher-order logic theorem prover ⓘ interactive theorem prover ⓘ proof assistant ⓘ |
| applicationDomain |
formal verification of hardware
ⓘ
formal verification of software ⓘ formalization of mathematics ⓘ |
| category |
formal verification tool
ⓘ
theorem proving software ⓘ |
| developer |
Lawrence C. Paulson
ⓘ
Markus Wenzel ⓘ
surface form:
Makarius Wenzel
Technical University of Munich ⓘ
surface form:
Technische Universität München
Tobias Nipkow ⓘ Cambridge University ⓘ
surface form:
University of Cambridge
|
| hasCommunityResource |
Archive of Formal Proofs
ⓘ
surface form:
Archive of Formal Proofs (AFP)
|
| hasComponent |
Code generator
ⓘ
Document preparation system ⓘ Isabelle/FOL ⓘ Isabelle/HOL: A Proof Assistant for Higher-Order Logic ⓘ
surface form:
Isabelle/HOL
Isabelle proof assistant self-linksurface differs ⓘ
surface form:
Isabelle/Isar
Isabelle/ZF ⓘ Isabelle/jEdit ⓘ Nitpick ⓘ Quickcheck ⓘ Sledgehammer ⓘ |
| hasDocumentation |
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
ⓘ
surface form:
Isabelle/HOL Tutorial
Isabelle/Isar Reference Manual ⓘ |
| hasRepository | https://isabelle.in.tum.de ⓘ |
| initialReleaseYear | 1986 ⓘ |
| license |
BSD license
ⓘ
surface form:
BSD-style license
open source ⓘ |
| namedAfter |
Isabelle proof assistant
self-linksurface differs
ⓘ
surface form:
Isabelle (a generic logical framework)
|
| notableUse |
Archive of Formal Proofs
ⓘ
CompCert-related formalisations (via HOL) and C semantics work ⓘ seL4 microkernel verification ⓘ |
| operatingSystem |
Linux
ⓘ
Windows ⓘ macOS ⓘ |
| primaryInterface |
Isabelle/jEdit
ⓘ
Isar proof language ⓘ |
| programmingLanguage |
Poly/ML
ⓘ
surface form:
Poly/ML (runtime)
Scala ⓘ Standard ML ⓘ |
| supportsFeature |
automated proof search
ⓘ
code generation to functional languages ⓘ coinductive definitions ⓘ document generation (LaTeX, PDF) ⓘ inductive definitions ⓘ integration with external automated theorem provers ⓘ interactive proof development ⓘ locales and type classes ⓘ polymorphic types ⓘ type inference ⓘ |
| supportsLogic |
Isabelle/FOL
ⓘ
Isabelle proof assistant self-linksurface differs ⓘ
surface form:
Isabelle/HOL
Zermelo–Fraenkel set theory ⓘ
surface form:
Isabelle/ZF
first-order logic (via object logics) ⓘ higher-order logic ⓘ set theory (via HOL and other object logics) ⓘ |
| supportsStyle |
declarative proofs
ⓘ
procedural proofs ⓘ |
| usesProofLanguage | Isar ⓘ |
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 proof assistant Description of subject: 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.
Referenced by (15)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Isabelle theorem prover
this entity surface form:
Isabelle/HOL
subject surface form:
Isabelle
this entity surface form:
Isabelle/HOL
subject surface form:
Isabelle
this entity surface form:
Isabelle/Isar
subject surface form:
Isabelle
this entity surface form:
Isabelle (a generic logical framework)
this entity surface form:
Isabelle theorem prover
this entity surface form:
Isabelle theorem prover
this entity surface form:
Isar – A Generic Interpretative Approach to Readable Formal Proofs
this entity surface form:
Isabelle/HOL
this entity surface form:
Isabelle theorem prover