Triple
T9566738
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hindley–Milner type system |
E230805
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
System F
System F is a polymorphic lambda calculus that extends simple type systems with universal quantification over types, forming a foundational framework for studying typed functional programming and type theory.
|
E807603
|
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: System F | Statement: [Hindley–Milner type system, relatedTo, System F]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: System F Context triple: [Hindley–Milner type system, relatedTo, System F]
-
A.
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.
-
B.
Franz Lisp
Franz Lisp is a dialect of the Lisp programming language developed in the late 1970s at the University of California, Berkeley, primarily for use in artificial intelligence research and symbolic computation.
-
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.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
E.
FLOW-MATIC programming language
FLOW-MATIC programming language is an early English-like business data processing language developed in the 1950s that heavily influenced the design of COBOL.
- 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: System F Triple: [Hindley–Milner type system, relatedTo, System F]
Generated description
System F is a polymorphic lambda calculus that extends simple type systems with universal quantification over types, forming a foundational framework for studying typed functional programming and type theory.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: System F Target entity description: System F is a polymorphic lambda calculus that extends simple type systems with universal quantification over types, forming a foundational framework for studying typed functional programming and type theory.
-
A.
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.
-
B.
Franz Lisp
Franz Lisp is a dialect of the Lisp programming language developed in the late 1970s at the University of California, Berkeley, primarily for use in artificial intelligence research and symbolic computation.
-
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.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
E.
FLOW-MATIC programming language
FLOW-MATIC programming language is an early English-like business data processing language developed in the 1950s that heavily influenced the design of COBOL.
- 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_69ca847f22188190a56e4a97625bef22 |
completed | March 30, 2026, 2:11 p.m. |
| NER | Named-entity recognition | batch_69cd996df4f08190b19bbaefb10a9789 |
completed | April 1, 2026, 10:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d152b09c808190aff32419f2cbb15f |
completed | April 4, 2026, 6:04 p.m. |
| NEDg | Description generation | batch_69d153d59844819086a0f50e6a7624b2 |
completed | April 4, 2026, 6:09 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69d1546a503c81908edc9588adabc172 |
completed | April 4, 2026, 6:11 p.m. |
Created at: March 30, 2026, 8:04 p.m.