Scheme: A interpreter for extended lambda calculus
From MaRDI portal
Publication:1290339
DOI10.1023/A:1010035624696zbMath0929.68045OpenAlexW2107219179WikidataQ56430279 ScholiaQ56430279MaRDI QIDQ1290339
Gerald J. Sussman, Guy L. jun. Steele
Publication date: 16 August 1999
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1010035624696
Related Items
A syntactic theory of sequential control, A syntactic correspondence between context-sensitive calculi and abstract machines, Magic-sets for localised analysis of Java bytecode, A theory for program and data type specification, Capsules and Closures, Output driven interpretation of recursive programs, or writing creates and destroys data structures, Making computational sense of Montague's intensional logic, A syntactic theory of sequential state, On the dynamic extent of delimited continuations
