Triple
T2092388
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robin Milner |
E32698
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
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.
|
E230805
|
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: Hindley–Milner type system | Statement: [Robin Milner, knownFor, Hindley–Milner type system]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hindley–Milner type system Context triple: [Robin Milner, knownFor, Hindley–Milner type system]
-
A.
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.
-
B.
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.
-
C.
Revised^n Report on the Algorithmic Language Scheme
The Revised^n Report on the Algorithmic Language Scheme is the series of formal documents that define and evolve the official specification of the Scheme programming language.
-
D.
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.
-
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. 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: Hindley–Milner type system Triple: [Robin Milner, knownFor, Hindley–Milner type system]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hindley–Milner type system Target entity description: 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.
-
A.
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.
-
B.
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.
-
C.
Revised^n Report on the Algorithmic Language Scheme
The Revised^n Report on the Algorithmic Language Scheme is the series of formal documents that define and evolve the official specification of the Scheme programming language.
-
D.
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.
-
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. 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_69a885eba0708190999696a45cbec816 |
completed | March 4, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69abba774ca881909f83cf65ffeb24bb |
completed | March 7, 2026, 5:41 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae2746fb3481909e0b7fdbd4748245 |
completed | March 9, 2026, 1:49 a.m. |
| NEDg | Description generation | batch_69ae2868815881908d6163ab84060ec2 |
completed | March 9, 2026, 1:54 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69ae28ce87c8819097e0b5dab045d9a1 |
completed | March 9, 2026, 1:56 a.m. |
Created at: March 4, 2026, 7:43 p.m.