Representing control in the presence of one-shot continuations
- 1 May 1996
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 31 (5) , 99-107
- https://doi.org/10.1145/231379.231395
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Register allocation using lazy saves, eager restores, and greedy shufflingPublished by Association for Computing Machinery (ACM) ,1995
- An efficient implementation of multiple return values in SchemePublished by Association for Computing Machinery (ACM) ,1994
- Revised 4 report on the algorithmic language schemeACM SIGPLAN Lisp Pointers, 1991
- CMLPublished by Association for Computing Machinery (ACM) ,1991
- Representing control in the presence of first-class continuationsPublished by Association for Computing Machinery (ACM) ,1990
- Engines from continuationsComputer Languages, 1989
- The spineless tagless G-machinePublished by Association for Computing Machinery (ACM) ,1989
- Logic continuationsThe Journal of Logic Programming, 1987
- Abstracting timed preemption with enginesComputer Languages, 1987
- Obtaining coroutines with continuationsComputer Languages, 1986