Twelf
E588090
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Twelf canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6370859 — 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: Twelf Context triple: [LambdaProlog, influenced, Twelf]
-
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.
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.
-
C.
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.
-
D.
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.
-
E.
ACL2 theorem proving system
The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
- 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: Twelf Target entity description: 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.
-
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.
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.
-
C.
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.
-
D.
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.
-
E.
ACL2 theorem proving system
The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
logical framework
ⓘ
meta-logical tool ⓘ proof assistant ⓘ software system ⓘ |
| abbreviationOf | Type-specified WElf ⓘ |
| appliedTo |
logics
ⓘ
operational semantics of languages ⓘ programming languages ⓘ proof systems ⓘ type systems ⓘ |
| associatedWith |
Carsten Lutz
NERFINISHED
ⓘ
Carsten Schürmann NERFINISHED ⓘ Conal Elliott NERFINISHED ⓘ Frank Pfenning NERFINISHED ⓘ |
| basedOn | Edinburgh Logical Framework NERFINISHED ⓘ |
| developedAt | Carnegie Mellon University NERFINISHED ⓘ |
| hasComponent |
LF specification language
ⓘ
coverage checker ⓘ logic programming engine ⓘ meta-theorem prover ⓘ mode checker ⓘ termination checker ⓘ totality checker ⓘ |
| hasDocumentation |
Twelf Tutorial
NERFINISHED
ⓘ
Twelf User’s Guide NERFINISHED ⓘ |
| hasWebsite | https://twelf.org ⓘ |
| implements | LF type theory NERFINISHED ⓘ |
| license | open source license ⓘ |
| supports |
coverage checking
ⓘ
implementation of deductive systems ⓘ logic metatheory ⓘ mode checking ⓘ operational semantics ⓘ programming language metatheory ⓘ progress proofs ⓘ proof of properties of deductive systems ⓘ safety proofs ⓘ specification of deductive systems ⓘ termination checking ⓘ totality checking ⓘ type preservation proofs ⓘ type system metatheory ⓘ |
| usedFor |
education in programming language theory
ⓘ
formalization of metatheory ⓘ mechanized proofs ⓘ |
| uses |
dependent types
ⓘ
higher-order abstract syntax ⓘ logical relations style reasoning ⓘ |
| writtenIn | Standard ML NERFINISHED ⓘ |
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: Twelf Description of subject: 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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.