Representing control in the presence of first-class continuations
- 1 June 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 25 (6) , 66-77
- https://doi.org/10.1145/93548.93554
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Continuations and concurrencyPublished by Association for Computing Machinery (ACM) ,1990
- Implementation strategies for continuationsPublished by Association for Computing Machinery (ACM) ,1988
- Garbage collection can be faster than stack allocationInformation Processing Letters, 1987
- Abstracting timed preemption with enginesComputer Languages, 1987
- Memory allocation and higher-order functionsPublished by Association for Computing Machinery (ACM) ,1987
- Obtaining coroutines with continuationsComputer Languages, 1986
- Revised 3 report on the algorithmic language schemeACM SIGPLAN Notices, 1986
- ORBIT: an optimizing compiler for schemeACM SIGPLAN Notices, 1986
- The implementation of PC SchemePublished by Association for Computing Machinery (ACM) ,1986
- An efficient environment allocation scheme in an interpreter for a lexically-scoped LISPPublished by Association for Computing Machinery (ACM) ,1980