Abella
E514254
Abella is an interactive theorem prover and proof assistant designed for reasoning about relational specifications, particularly those involving higher-order abstract syntax and inductive and coinductive definitions.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Abella canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T5357422 — 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: Abella Context triple: [Dale Miller, notableConcept, Abella]
-
A.
Abella
Abella was an ancient town in Campania, Italy, known from Roman-era inscriptions and archaeological remains.
-
B.
Apphia
Apphia is a Christian woman mentioned in the New Testament as one of the recipients of Paul’s Epistle to Philemon, traditionally thought to be a member of Philemon’s household, possibly his wife.
-
C.
Barellan
Barellan is a small rural town in the Riverina region of New South Wales, Australia, known for its grain farming and association with tennis champion Evonne Goolagong-Cawley.
-
D.
Alberoni
Alberoni is an Italian surname most notably associated with Giulio Alberoni, an influential 18th-century cardinal and statesman.
-
E.
Ascella
Ascella is a prominent multiple star system in the constellation Sagittarius, known for being one of its brightest and most easily visible stars.
- 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: Abella Target entity description: Abella is an interactive theorem prover and proof assistant designed for reasoning about relational specifications, particularly those involving higher-order abstract syntax and inductive and coinductive definitions.
-
A.
Abella
Abella was an ancient town in Campania, Italy, known from Roman-era inscriptions and archaeological remains.
-
B.
Apphia
Apphia is a Christian woman mentioned in the New Testament as one of the recipients of Paul’s Epistle to Philemon, traditionally thought to be a member of Philemon’s household, possibly his wife.
-
C.
Barellan
Barellan is a small rural town in the Riverina region of New South Wales, Australia, known for its grain farming and association with tennis champion Evonne Goolagong-Cawley.
-
D.
Alberoni
Alberoni is an Italian surname most notably associated with Giulio Alberoni, an influential 18th-century cardinal and statesman.
-
E.
Ascella
Ascella is a prominent multiple star system in the constellation Sagittarius, known for being one of its brightest and most easily visible stars.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
interactive theorem prover
ⓘ
proof assistant ⓘ |
| appliedIn |
formalization of meta-theory of programming languages
ⓘ
verification of properties of logical frameworks ⓘ |
| basedOn | logic G ⓘ |
| canReasonAbout |
lambda-calculus
ⓘ
process calculi ⓘ type systems ⓘ |
| designedFor |
reasoning about formal systems
ⓘ
reasoning about operational semantics ⓘ reasoning about programming languages ⓘ |
| developedBy |
Alwen Tiu
NERFINISHED
ⓘ
Dale Miller NERFINISHED ⓘ Gopalan Nadathur NERFINISHED ⓘ |
| firstReleasedIn | 2000s ⓘ |
| hasFeature |
automation for routine proof steps
ⓘ
interactive proof development ⓘ support for binding and substitution reasoning ⓘ support for cut-admissibility style arguments ⓘ support for structural properties of contexts ⓘ tactic-based proof construction ⓘ |
| hasWebsite | http://abella-prover.org/ ⓘ |
| implements | two-level logic approach ⓘ |
| isFreeSoftware | true ⓘ |
| supports |
HOAS-style encodings
ⓘ
case analysis ⓘ coinduction ⓘ coinductive definitions ⓘ context reasoning ⓘ definitions by clauses ⓘ eigenvariable reasoning ⓘ equality reasoning ⓘ fixed-point definitions ⓘ generic judgments ⓘ higher-order abstract syntax ⓘ higher-order hereditary Harrop formulas ⓘ induction ⓘ inductive definitions ⓘ lambda-tree syntax ⓘ proof scripts ⓘ reasoning about relational specifications ⓘ unification over lambda-terms ⓘ |
| uses |
reasoning logic
ⓘ
specification logic ⓘ |
| writtenIn | OCaml 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: Abella Description of subject: Abella is an interactive theorem prover and proof assistant designed for reasoning about relational specifications, particularly those involving higher-order abstract syntax and inductive and coinductive definitions.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.