Scheme: An Interpreter for Extended Lambda Calculus
E456004
"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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Scheme: An Interpreter for Extended Lambda Calculus canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4602526 — 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.
Target entity: Scheme: An Interpreter for Extended Lambda Calculus Context triple: [Gerald Jay Sussman, notableWork, Scheme: An Interpreter for Extended Lambda Calculus]
-
A.
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.
-
B.
Chez Scheme
Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
-
C.
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.
-
D.
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs is a seminal computer science textbook by Harold Abelson and Gerald Jay Sussman that uses the Scheme language to teach fundamental principles of programming and software design.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Scheme: An Interpreter for Extended Lambda Calculus Target entity description: "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.
-
A.
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.
-
B.
Chez Scheme
Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
-
C.
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.
-
D.
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs is a seminal computer science textbook by Harold Abelson and Gerald Jay Sussman that uses the Scheme language to teach fundamental principles of programming and software design.
-
E.
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.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
computer science publication
ⓘ
programming languages paper ⓘ technical report ⓘ |
| affiliatedProject | MIT AI Lab Scheme project NERFINISHED ⓘ |
| affiliatedWith | MIT Artificial Intelligence Laboratory NERFINISHED ⓘ |
| author |
Gerald Jay Sussman
NERFINISHED
ⓘ
Guy L. Steele Jr. NERFINISHED ⓘ |
| basedOn |
Lisp
NERFINISHED
ⓘ
lambda calculus NERFINISHED ⓘ |
| coAuthor |
Gerald Jay Sussman
NERFINISHED
ⓘ
Guy L. Steele Jr. NERFINISHED ⓘ |
| demonstrates |
power of first-class procedures
ⓘ
power of lexical scoping ⓘ use of continuations in interpreters ⓘ |
| describes | Scheme programming language NERFINISHED ⓘ |
| field |
computer science
ⓘ
lambda calculus ⓘ programming languages ⓘ |
| genre | technical report ⓘ |
| hasSubject |
control structures in interpreters
ⓘ
environment models of evaluation ⓘ procedures as first-class objects ⓘ |
| influenced |
Scheme standardization efforts
ⓘ
design of minimalist programming languages ⓘ research in functional programming ⓘ |
| institution | Massachusetts Institute of Technology NERFINISHED ⓘ |
| introduced | Scheme programming language NERFINISHED ⓘ |
| language | English ⓘ |
| notableFor |
formalizing first-class procedures in a Lisp dialect
ⓘ
introducing Scheme as a lexically scoped Lisp ⓘ seminal contribution to programming language theory ⓘ |
| placeOfOrigin | Cambridge, Massachusetts NERFINISHED ⓘ |
| publicationType | MIT AI Lab technical report NERFINISHED ⓘ |
| publicationYear | 1975 ⓘ |
| relatedTo |
Lisp programming language
NERFINISHED
ⓘ
The Revised Report on Scheme NERFINISHED ⓘ lambda calculus in programming language design ⓘ |
| title | Scheme: An Interpreter for Extended Lambda Calculus NERFINISHED ⓘ |
| topic |
Lisp dialects
ⓘ
first-class procedures ⓘ interpreter implementation ⓘ lambda calculus ⓘ lexical scoping ⓘ minimalist language design ⓘ |
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.
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.
Subject: Scheme: An Interpreter for Extended Lambda Calculus Description of subject: "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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.