Representing control in the presence of one-shot continuations

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 5, 1996, Pages 99-107

  Bruggeman, Carl ^a   Waddell, Oscar ^a   Dybvig, R Kent ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144417790     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/249069.231395     Document Type: Article

References (24)

1. Andrew W. Appel and David B. MacQueen. Standard ML of New Jersey. In Proceedings of the Third International Symposium on Programming Language Implementation and Logic Programming, pages 1-13, August 1991.
2. Andrew W. Appel and Zhong Shao. An empirical and analytical study of stack vs. heap cost for languages with closures. Technical Report CS-TR-450-94, Princeton University, March 1994. Revised version to appear in Journal of Functional Programming.
3. Andrew W. Appel and Zhong Shao. An empirical and analytical study of stack vs. heap cost for languages with closures. Technical Report CS-TR-450-94, Princeton University, March 1994. Revised version to appear in Journal of Functional Programming.
4. J. Michael Ashley and R. Kent Dybvig. An efficient implementation of multiple return values in scheme. In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, pages 140-149, July 1994.
5. Robert G. Burger, Oscar Waddell, and R. Kent Dybvig. Register allocation using lazy saves, eager restores, and greedy shuffling. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation, pages 130-138, June 1995.
6. 4 report on the algorithmic language Scheme. LISP Pointers, 4(3), 1991.
7. William F. Clocksin and Christopher S. Mellish. Programming in Prolog. Springer-Verlag, second edition, 1984.
8. Christopher T. Haynes Daniel P. Friedman and Mitchell Wand. Obtaining coroutines with continuations. Computer Languages, 11(3/4):143-153, 1986.
9. R. Kent Dybvig. The Scheme Programming Language. Prentice Hall, second edition, 1996.
10. R. Kent Dybvig and Robert Hieb. Engines from continuations. Computer Languages, 14(2):109-123, 1989.
11. Mathias Felleisen. Transliterating Prolog into Scheme. Technical Report 182, Indiana University, October 1985.
12. Richard P. Gabriel. Performance and Evaluation of LISP Systems. MIT Press, Cambridge, MA, 1985.
13. Emden R. Gansner and John H. Reppy. A multithreaded higher-order user interface toolkit. In User Interface Software. John Wiley &: Sons Ltd, 1993.
14. Paul Haahr. Montage: Breaking windowing into small pieces. In USENIX Summer Conference, pages 289-297, Anaheim, June 1990.
15. Christopher T. Haynes. Logic continuations. LISP Pointers, pages 157-176, 1987.
16. Christopher T. Haynes and Daniel P. Friedman. Abstracting timed preemption with engines. Computer Languages, 12(2):109-121, 1987.
17. Robert Hieb, R. Kent Dybvig, and Carl Bruggeman. Representing control in the presence of first-class continuations. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, pages 66-77, June 1990.
18. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, Cambridge, 1990.
19. Simon L. Peyton-Jones. private communication, December 1991.
20. Simon L. Peyton-Jones and Jon Salkild. The spineless tagless G-machine. In Proceedings of the Fourth Conference on Functional Programming and Computer Architecture, pages 184-201, September 1989.
21. R. Pike. A concurrent window system. Computing Systems, 2(2):133-153, 89.
22. John H. Reppy. CML: A higher-order concurrent language. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 293-305, Toronto, June 1991.
23. Gerald J. Sussman and Guy L. Steele Jr. Scheme: An interpreter for extended lambda calculus. AI Memo 349, Massachusetts Institute of Technology Artificial Intelligence Lab, 1975.
24. Oscar Waddell. The Scheme Widget Library User's Manual. Indiana University, Bloomington, Indiana, 1995.