Triple

T10063118
Position Surface form Disambiguated ID Type / Status
Subject Haskell Curry E213034 entity
Predicate hasConceptNamedAfter P3325 FINISHED
Object Curry’s combinator E588865 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’s combinator | Statement: [Haskell Curry, hasConceptNamedAfter, Curry’s combinator]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Curry’s combinator
Context triple: [Haskell Curry, hasConceptNamedAfter, Curry’s combinator]
  • A. Curry encoding
    Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
  • B. Curry (program transformation)
    Curry (program transformation) is a program transformation technique in functional programming, named after logician Haskell Curry, that systematically converts higher-order functions into equivalent first-order forms.
  • C. combinatory logic chosen
    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.
  • D. 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.
  • E. Kleene’s recursion theorem
    Kleene’s recursion theorem is a fundamental result in computability theory that guarantees the existence of self-referential programs, allowing a program to effectively obtain and use its own description.
  • 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_69d2b630ca008190a337660ad8c9d57e completed April 5, 2026, 7:21 p.m.
Created at: March 30, 2026, 8:58 p.m.