Landin’s SECD machine
E554845
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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| SECD machine | 2 |
| Landin’s SECD machine canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5923105 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Landin’s SECD machine Context triple: [ISWIM, influencedBy, Landin’s SECD machine]
-
A.
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.
-
B.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
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.
Partial Evaluation and Program Manipulation
Partial Evaluation and Program Manipulation (PEPM) is a specialized conference and research area in computer science focused on techniques for program transformation, optimization, and analysis through partial evaluation and related methods.
-
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. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Landin’s SECD machine Target entity description: 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.
-
A.
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.
-
B.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
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.
Partial Evaluation and Program Manipulation
Partial Evaluation and Program Manipulation (PEPM) is a specialized conference and research area in computer science focused on techniques for program transformation, optimization, and analysis through partial evaluation and related methods.
-
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. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
abstract machine
ⓘ
evaluation model ⓘ operational semantics formalism ⓘ |
| acronymFor | Stack Environment Control Dump NERFINISHED ⓘ |
| associatedInstitution | University of London NERFINISHED ⓘ |
| associatedWithPerson | Peter J. Landin NERFINISHED ⓘ |
| creator | Peter J. Landin NERFINISHED ⓘ |
| evaluationStrategy | environment-based evaluation ⓘ |
| field |
functional programming
ⓘ
operational semantics ⓘ programming language theory ⓘ |
| formalismType | small-step operational semantics ⓘ |
| hasComponent |
control
ⓘ
dump ⓘ environment ⓘ stack ⓘ |
| hasEvaluationConfiguration | quadruple (S,E,C,D) ⓘ |
| historicalSignificance | pioneering model for functional program execution ⓘ |
| influenced |
CAM (Categorical Abstract Machine)
NERFINISHED
ⓘ
G-machine NERFINISHED ⓘ Krivine machine NERFINISHED ⓘ ZINC machine NERFINISHED ⓘ abstract machines for functional languages ⓘ design of functional language implementations ⓘ |
| introducedInPublication | The Mechanical Evaluation of Expressions NERFINISHED ⓘ |
| languageStyle | lambda-calculus-based ⓘ |
| models |
environment-based variable binding
ⓘ
evaluation of lambda calculus expressions ⓘ |
| notableFor |
being one of the first abstract machines for functional languages
ⓘ
explicit representation of environment and control ⓘ influencing later formalizations of functional language execution ⓘ |
| originCountry | United Kingdom NERFINISHED ⓘ |
| publicationYear | 1964 ⓘ |
| purpose | to provide a systematic model for evaluating expressions ⓘ |
| relatedTo |
denotational semantics
ⓘ
implementation of functional languages ⓘ lambda calculus ⓘ |
| supports |
call-by-value evaluation
ⓘ
higher-order functions ⓘ lexical scoping ⓘ |
| timePeriod | 1960s ⓘ |
| usedFor |
research on abstract machines
ⓘ
teaching operational semantics of functional languages ⓘ |
| usesDataStructure |
control list for program code
ⓘ
dump for saved machine states ⓘ environment for variable bindings ⓘ stack for intermediate values ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Landin’s SECD machine Description of subject: 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.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
SECD machine