Triple
T17872511
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Coq |
E446868
|
entity |
| Predicate | implements |
P1417
|
FINISHED |
| Object | Predicative Calculus of Inductive Constructions |
—
|
NE NERFINISHED |
How this triple was built (2 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Predicative Calculus of Inductive Constructions | Statement: [Coq, implements, Predicative Calculus of Inductive Constructions]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Predicative Calculus of Inductive Constructions Context triple: [Coq, implements, Predicative Calculus of Inductive Constructions]
-
A.
Calculus of Inductive Constructions
chosen
Calculus of Inductive Constructions is a powerful type theory that combines higher-order logic with inductive types and dependent types, forming the formal foundation of the Coq proof assistant.
-
B.
Martin-Löf type theory
Martin-Löf type theory is a foundational system for constructive mathematics and computer science that integrates logic and computation through dependent types and serves as a basis for proof assistants and functional programming languages.
-
C.
calculus of constructions
The calculus of constructions is a powerful type theory and foundational formal system that unifies higher-order logic and typed lambda calculus, serving as the basis for several modern proof assistants.
-
D.
Curry–Howard correspondence
The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
-
E.
Inria–Université Paris-Sud–CNRS research community around Coq
The Inria–Université Paris-Sud–CNRS research community around Coq is a collaborative French research group focused on the development, theory, and applications of the Coq proof assistant in formal methods and computer science.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69d8b9f4c22c819093c2680434472894 |
completed | April 10, 2026, 8:51 a.m. |
| NER | Named-entity recognition | batch_69e49aa3cd248190a13a8209ba44fd3b |
completed | April 19, 2026, 9:04 a.m. |
Created at: April 10, 2026, 10:18 a.m.