Triple

T11210418

Position	Surface form	Disambiguated ID	Type / Status
Subject	Thierry Coquand	`E265289`	entity
Predicate	knownFor	`P22`	FINISHED
Object	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.	`E911973`	NE FINISHED

How this triple was built (4 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: calculus of constructions | Statement: [Thierry Coquand, knownFor, calculus of constructions]

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: calculus of constructions
Context triple: [Thierry Coquand, knownFor, calculus of constructions]

A. 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.
B. lambda calculus
Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
C. Coq
Coq is an interactive theorem prover and functional programming language based on dependent type theory, widely used for formally verifying mathematical proofs and software correctness.
D. Brouwer–Heyting–Kolmogorov interpretation
The Brouwer–Heyting–Kolmogorov interpretation is a foundational explanation of intuitionistic logic that interprets logical connectives and proofs in terms of explicit constructions and algorithms rather than classical truth values.
E. combinatory logic
Combinatory logic is a foundational formal system in mathematical logic and computer science that eliminates variables by expressing computation through the combination of a small set of primitive functions.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NEDg Description generation gpt-5.1

Instruction

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Input

Entity: calculus of constructions
Triple: [Thierry Coquand, knownFor, calculus of constructions]

Generated description

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.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: calculus of constructions
Target entity description: 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.

A. 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.
B. lambda calculus
Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
C. Coq
Coq is an interactive theorem prover and functional programming language based on dependent type theory, widely used for formally verifying mathematical proofs and software correctness.
D. Brouwer–Heyting–Kolmogorov interpretation
The Brouwer–Heyting–Kolmogorov interpretation is a foundational explanation of intuitionistic logic that interprets logical connectives and proofs in terms of explicit constructions and algorithms rather than classical truth values.
E. combinatory logic
Combinatory logic is a foundational formal system in mathematical logic and computer science that eliminates variables by expressing computation through the combination of a small set of primitive functions.
F. None of above. chosen

Provenance (5 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_69d6aac59460819089b9848b27f57848`	completed	April 8, 2026, 7:21 p.m.
NER	Named-entity recognition	`batch_69d7e8d6f5d4819086dcb776a0d469e8`	completed	April 9, 2026, 5:58 p.m.
NED1	Entity disambiguation (via context triple)	`batch_69e49747ec288190bc3e826b6de7f6f2`	completed	April 19, 2026, 8:50 a.m.
NEDg	Description generation	`batch_69e49c0a92b08190ac5debb7d67ca776`	completed	April 19, 2026, 9:10 a.m.
NED2	Entity disambiguation (via description)	`batch_69e49e8dc4ec81908d0defe77827d197`	completed	April 19, 2026, 9:21 a.m.

Created at: April 8, 2026, 9:30 p.m.