Triple
T9566739
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hindley–Milner type system |
E230805
|
entity |
| Predicate | restrictionOf |
P1050
|
FINISHED |
| Object | System F |
E807603
|
NE FINISHED |
How this triple was built (3 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, restrictionOf, System F]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: System F Context triple: [Hindley–Milner type system, restrictionOf, System F]
-
A.
System F
chosen
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.
-
B.
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.
-
C.
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.
-
D.
Chez Scheme
Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: restrictionOf Context triple: [Hindley–Milner type system, restrictionOf, System F]
-
A.
restrictionOfPact
Indicates a relationship where one pact imposes limitations, conditions, or constraints on another pact or agreement.
-
B.
restriction
chosen
Indicates a limiting condition or rule that constrains or controls what an entity can do, use, or access in relation to another entity or context.
-
C.
notableRestriction
Indicates that there is a significant limitation, constraint, or prohibition that meaningfully affects the entity or its use.
-
D.
restrictedFromUseFor
Indicates that something is prohibited or limited from being used for a specified purpose, context, or application.
-
E.
mandateRestriction
Indicates that an authority imposes a binding limitation or requirement on an entity’s actions or conditions.
- F. None of above.
Provenance (4 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_69d16149c7808190b476ec06e9780a03 |
completed | April 4, 2026, 7:06 p.m. |
| PD | Predicate disambiguation | batch_69ccd59b960c8190966a8870a2426bd5 |
completed | April 1, 2026, 8:21 a.m. |
Created at: March 30, 2026, 8:04 p.m.