Triple
T23281170
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Curry–Howard correspondence |
E588866
|
entity |
| Predicate | formalizedIn |
P6279
|
FINISHED |
| Object | Howard 1969 paper "The formulae-as-types notion of construction" |
—
|
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: Howard 1969 paper "The formulae-as-types notion of construction" | Statement: [Curry–Howard correspondence, formalizedIn, Howard 1969 paper "The formulae-as-types notion of construction"]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Howard 1969 paper "The formulae-as-types notion of construction" Context triple: [Curry–Howard correspondence, formalizedIn, Howard 1969 paper "The formulae-as-types notion of construction"]
-
A.
Curry–Howard correspondence
chosen
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.
Calculus of Inductive Constructions
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.
-
C.
“Types, Abstraction and Parametric Polymorphism”
“Types, Abstraction and Parametric Polymorphism” is a seminal paper in programming language theory that introduced and formalized the concept of parametric polymorphism and its role in type systems and data abstraction.
-
D.
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.
-
E.
"A Correspondence between ALGOL 60 and Church’s Lambda-notation"
"A Correspondence between ALGOL 60 and Church’s Lambda-notation" is a seminal paper by Peter Landin that introduced the use of lambda calculus to formally describe and reason about the semantics of the ALGOL 60 programming language, helping to found the field of denotational semantics.
- 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_69e25d16e2c08190a291de254703129e |
completed | April 17, 2026, 4:17 p.m. |
| NER | Named-entity recognition | batch_69f19642b46481909fd455acd2155792 |
completed | April 29, 2026, 5:25 a.m. |
Created at: April 17, 2026, 4:57 p.m.