Scheme: An Interpreter for Extended Lambda Calculus
|Scheme: An Interpreter for Extended Lambda Calculus (1975)
||Lambda: The Ultimate Imperative→|
|AI Memo 349, the first of the Lambda Papers.
This paper gave the original definition and implementation of the Scheme programming language, a Lisp dialect with full lexical closure based on the lambda calculus, and demonstrated how it can be used to reason about the semantics of tail recursive iteration and continuation-passing style.
- Whole text
|This work is licensed under the Creative Commons Attribution 3.0 Unported License.
This page must provide all available authorship information.