Triple
T18653736
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Scheme: An Interpreter for Extended Lambda Calculus |
E456004
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | The Revised Report on Scheme |
—
|
NE NERFINISHED |
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: The Revised Report on Scheme | Statement: [Scheme: An Interpreter for Extended Lambda Calculus, relatedTo, The Revised Report on Scheme]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: The Revised Report on Scheme Context triple: [Scheme: An Interpreter for Extended Lambda Calculus, relatedTo, The Revised Report on Scheme]
-
A.
Revised^n Report on the Algorithmic Language Scheme
chosen
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.
-
B.
Rabbit: A Compiler for Scheme (thesis)
"Rabbit: A Compiler for Scheme" is Guy L. Steele Jr.'s influential doctoral thesis that introduced one of the earliest optimizing compilers for the Scheme programming language, helping to establish Scheme as a practical vehicle for language and compiler research.
-
C.
Scheme: An Interpreter for Extended Lambda Calculus
"Scheme: An Interpreter for Extended Lambda Calculus" is the seminal 1975 technical report by Gerald Jay Sussman and Guy L. Steele Jr. that introduced the Scheme programming language and demonstrated the power of lexical scoping and first-class procedures in a minimalist Lisp dialect.
-
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.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69d8d38ea1e88190997e9b231190ba6f |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e55013997881909eee52c0a7335f4b |
completed | April 19, 2026, 9:58 p.m. |
Created at: April 10, 2026, 11:47 a.m.