Triple
T23281138
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Curry–Howard correspondence |
E588866
|
entity |
| Predicate | alsoKnownAs |
P39
|
FINISHED |
| Object | propositions-as-types |
—
|
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: propositions-as-types | Statement: [Curry–Howard correspondence, alsoKnownAs, propositions-as-types]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: propositions-as-types Context triple: [Curry–Howard correspondence, alsoKnownAs, propositions-as-types]
-
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.
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.
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.
-
E.
"Types and Programming Languages"
"Types and Programming Languages" is a widely acclaimed textbook that provides a rigorous, foundational introduction to type systems and programming language theory for computer science students and researchers.
- 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.