Archive of Formal Proofs
E822908
computer science repository
digital archive
formal proof library
mathematics repository
online library
The Archive of Formal Proofs is an online, peer-reviewed collection of machine-checked mathematical and computer science proofs formalized primarily in the Isabelle proof assistant.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Archive of Formal Proofs canonical | 2 |
| Archive of Formal Proofs (AFP) | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9810096 — 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: Archive of Formal Proofs Context triple: [Isabelle, notableUse, Archive of Formal Proofs]
-
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.
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.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
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.
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.
- 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: Archive of Formal Proofs Target entity description: The Archive of Formal Proofs is an online, peer-reviewed collection of machine-checked mathematical and computer science proofs formalized primarily in the Isabelle 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.
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.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
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.
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.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
computer science repository
ⓘ
digital archive ⓘ formal proof library ⓘ mathematics repository ⓘ online library ⓘ |
| accessModel | open access ⓘ |
| contentType |
Isabelle theories
ⓘ
formal proof developments ⓘ formalizations of computer science concepts ⓘ formalizations of mathematical theories ⓘ machine-checked theorems ⓘ |
| field |
computer science
ⓘ
formal methods ⓘ mathematics ⓘ theorem proving ⓘ |
| focus |
formal verification
ⓘ
formalized computer science ⓘ formalized mathematics ⓘ machine-checked proofs ⓘ |
| goal |
to encourage reuse of formalized results
ⓘ
to provide a structured collection of formal proofs ⓘ to support research in formal methods and theorem proving ⓘ |
| hasFormat |
HTML
ⓘ
Isabelle source files ⓘ PDF ⓘ |
| hasLanguage | Isabelle theory language ⓘ |
| hasTopic |
algebra
ⓘ
algorithms ⓘ analysis ⓘ automata theory ⓘ category theory ⓘ combinatorics ⓘ concurrency ⓘ cryptography ⓘ data structures ⓘ formal languages ⓘ logic ⓘ number theory ⓘ probability theory ⓘ program verification ⓘ set theory ⓘ topology ⓘ |
| licenseType | permissive licenses ⓘ |
| mainTool |
Isabelle
ⓘ
Isabelle/HOL ⓘ |
| reviewProcess | peer-reviewed ⓘ |
| supports |
citation of formal proofs
ⓘ
continuous maintenance of formalizations ⓘ reusable proof components ⓘ versioned entries ⓘ |
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: Archive of Formal Proofs Description of subject: The Archive of Formal Proofs is an online, peer-reviewed collection of machine-checked mathematical and computer science proofs formalized primarily in the Isabelle proof assistant.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
Isabelle proof assistant
subject linked to:
Isabelle proof assistant
linked to: Archive of Formal Proofs