Triple
T10063106
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Haskell Curry |
E213034
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | combinatory logic |
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: combinatory logic | Statement: [Haskell Curry, notableWork, combinatory logic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: combinatory logic Context triple: [Haskell Curry, notableWork, combinatory logic]
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
linear logic
Linear logic is a substructural logic introduced by Jean-Yves Girard that treats logical propositions as resources, carefully tracking their use to model state change, concurrency, and resource-sensitive computation.
-
E.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
- 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.