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 |
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