Triple

T10063107
Position Surface form Disambiguated ID Type / Status
Subject Haskell Curry E213034 entity
Predicate notableWork P4 FINISHED
Object Curry–Howard correspondence (foundational ideas) 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: Curry–Howard correspondence (foundational ideas) | Statement: [Haskell Curry, notableWork, Curry–Howard correspondence (foundational ideas)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Curry–Howard correspondence (foundational ideas)
Context triple: [Haskell Curry, notableWork, Curry–Howard correspondence (foundational ideas)]
  • 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. 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.
  • C. Recursive Functions and Intuitionistic Mathematics
    Recursive Functions and Intuitionistic Mathematics is a seminal work by Stephen Kleene that develops the theory of recursive (computable) functions within the framework of intuitionistic logic and mathematics.
  • D. Hilbert’s program
    Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
  • E. Hoare logic
    Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
  • 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_69ca83977128819084084eb7d1d8c52a completed March 30, 2026, 2:07 p.m.
NER Named-entity recognition batch_69cdcfd4e4ac8190a37061b4082caa48 completed April 2, 2026, 2:09 a.m.
NED1 Entity disambiguation (via context triple) batch_69d29a7bd56c8190a6c43df26db880f4 completed April 5, 2026, 5:23 p.m.
Created at: March 30, 2026, 8:58 p.m.