Triple

T1255183
Position Surface form Disambiguated ID Type / Status
Subject lambda calculus E26971 entity
Predicate hasEncoding P17351 FINISHED
Object Curry encoding
Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
 E143341 NE FINISHED

How this triple was built (4 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 encoding | Statement: [lambda calculus, hasEncoding, Curry encoding]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Curry encoding
Context triple: [lambda calculus, hasEncoding, Curry encoding]
  • A. lambda calculus
    Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
  • B. Gödel numbering
    Gödel numbering is a method in mathematical logic that encodes symbols, formulas, and proofs as unique natural numbers, enabling arithmetic to represent and reason about syntactic statements.
  • C. Chez Scheme
    Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
  • D. Curry paradox
    Curry paradox is a self-referential logical paradox that arises in certain formal systems without using negation, showing how naive reasoning about implication and self-reference can lead to triviality.
  • E. Haskell
    Haskell is a statically typed, purely functional programming language known for its strong type system, lazy evaluation, and use in both academic research and industry.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Curry encoding
Triple: [lambda calculus, hasEncoding, Curry encoding]
Generated description
Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Curry encoding
Target entity description: Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
  • A. lambda calculus
    Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
  • B. Gödel numbering
    Gödel numbering is a method in mathematical logic that encodes symbols, formulas, and proofs as unique natural numbers, enabling arithmetic to represent and reason about syntactic statements.
  • C. Chez Scheme
    Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
  • D. Curry paradox
    Curry paradox is a self-referential logical paradox that arises in certain formal systems without using negation, showing how naive reasoning about implication and self-reference can lead to triviality.
  • E. Haskell
    Haskell is a statically typed, purely functional programming language known for its strong type system, lazy evaluation, and use in both academic research and industry.
  • F. None of above. chosen

Provenance (5 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_69a49487a9c48190ba9b05348fd1b53f completed March 1, 2026, 7:33 p.m.
NER Named-entity recognition batch_69a4bfa5a4cc819093ed686619b572d8 completed March 1, 2026, 10:37 p.m.
NED1 Entity disambiguation (via context triple) batch_69ac93cb76248190a23acb2e76ecfa8d completed March 7, 2026, 9:08 p.m.
NEDg Description generation batch_69ac9453f4488190a13ebabf3c8e07a5 completed March 7, 2026, 9:10 p.m.
NED2 Entity disambiguation (via description) batch_69ac952f74d48190b075919e0acd513d completed March 7, 2026, 9:14 p.m.
Created at: March 1, 2026, 7:47 p.m.