Revised 4 report on the algorithmic language scheme
- 1 July 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Lisp Pointers
- Vol. IV (3) , 1-55
- https://doi.org/10.1145/382130.382133
Abstract
No abstract availableThis publication has 56 references indexed in Scilit:
- Towards a facility for lexically scoped, dynamic mutual recursion in SchemeComputer Languages, 1990
- Control delimiters and their hierarchiesHigher-Order and Symbolic Computation, 1990
- Engines from continuationsComputer Languages, 1989
- Expansion-passing style: A general macro mechanismHigher-Order and Symbolic Computation, 1988
- Reflections on Landin's J-operator: A partly historical noteComputer Languages, 1987
- Using closures for code generationComputer Languages, 1987
- Abstracting timed preemption with enginesComputer Languages, 1987
- Obtaining coroutines with continuationsComputer Languages, 1986
- A closer look at export and import statementsComputer Languages, 1986
- Compiling lambda-expressions using continuations and factorizationsComputer Languages, 1978