Triple
T14341906
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Philip Wadler |
E355623
|
entity |
| Predicate | coAuthored |
P2389
|
FINISHED |
| Object | “Propositions as Types” |
E588866
|
NE FINISHED |
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: [Philip Wadler, coAuthored, “Propositions as Types”]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: “Propositions as Types” Context triple: [Philip Wadler, coAuthored, “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.
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.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d8278fa2108190bc0d0e7939c1eb03 |
completed | April 9, 2026, 10:26 p.m. |
| NER | Named-entity recognition | batch_69de8e87febc8190a63c668cbd0fd713 |
completed | April 14, 2026, 6:59 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fd469bc538819099ed5b7061cf140d |
completed | May 8, 2026, 2:12 a.m. |
Created at: April 10, 2026, 1:14 a.m.