Formalizing implementation strategies for first-class continuations?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1782, Issue , 2000, Pages 88-103

  Danvy, Olivier ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ABSTRACT MACHINES; CONTINUATION-PASSING STYLE; FORMAL PROOFS; IMPLEMENTATION STRATEGIES; SECOND CLASS; SPECIAL TREATMENTS;

ARTIFICIAL INTELLIGENCE;

EID: 84947281307     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46425-5_6     Document Type: Conference Paper

References (22)

1. Andrew W. Appel and David B. MacQueen. Standard ML of New Jersey. In Third International Symposium on Programming Language Implementation and Logic Programming, number 528 in Lecture Notes in Computer Science, pages 1- 13, Passau, Germany, August 1991.
2. David B. Bartley and John C. Jensen. The implementation of PC Scheme. In Proceedings of the 1986 ACM Conference on Lisp and Functional Programming, pages 86-93, Cambridge, Massachusetts, August 1986.
3. Daniel M. Berry. Block structure: Retention or deletion? (extended abstract). In Conference Record of the Third Annual ACM Symposium on Theory of Computing, pages 86-100, Shaker Heights, Ohio, May 1971.
4. William Clinger, Anne H. Hartheimer, and Eric M. Ost. Implementation strategies for first-class continuations. Higher-Order and Symbolic Computation, 12(1):7-45, 1999.
5. Olivier Danvy. Memory allocation and higher-order functions. In Proceedings of the ACM SIGPLAN'87 Symposium on Interpreters and Interpretive Techniques, SIGPLAN Notices, Vol. 22, No 7, pages 241-252, Saint-Paul, Minnesota, June 1987.
6. Olivier Danvy, Belmina Dzafic, and Frank Pfenning. On proving syntactic pro- perties of CPS programs. In Third International Workshop on Higher-Order Ope- rational Techniques in Semantics, volume 26 of Electronic Notes in Theoretical Computer Science, pages 19-31, Paris, France, September 1999.
7. Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
8. Olivier Danvy and Julia L. Lawall. Back to direct style II: First-class continuations. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, LISP Pointers, Vol. 5, No. 1, pages 299-310, San Francisco, California, June 1992.
9. Olivier Danvy and Frank Pfenning. The occurrence of continuation parameters in CPS terms. Technical report CMU-CS-95-121, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, February 1995.
10. Bruce F. Duba, Robert Harper, and David B. MacQueen. Typing first-class con- tinuations in ML. In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 163-173, Orlando, Florida, January 1991.
11. Belmina Dzafic. Formalizing program transformations. Master's thesis, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, De- cember 1998.
12. Matthias Felleisen. The Calculi of _-v-CS Conversion: A Syntactic Theory of Con- trol and State in Imperative Higher-Order Programming Languages. PhD thesis, Department of Computer Science, Indiana University, Bloomington, Indiana, Au- gust 1987.
13. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In Proceedings of the ACM SIGPLAN'93 Confe- rence on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 28, No 6, pages 237-247, Albuquerque, New Mexico, June 1993.
14. Christopher T. Haynes and Daniel P. Friedman. Embedding continuations in procedural objects. ACM Transactions on Programming Languages and Systems, 9(4):582-598, 1987.
15. Robert Hieb, R. Kent Dybvig, and Carl Bruggeman. Representing control in the presence of _rst-class continuations. In Proceedings of the ACM SIGPLAN'90 Conference on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 25, No 6, pages 66-77, White Plains, New York, June 1990.
16. Richard A. Kelsey and Jonathan A. Rees. A tractable Scheme implementation. Lisp and Symbolic Computation, 7(4):315-336, 1994.
17. David Kranz, Richard Kesley, Jonathan Rees, Paul Hudak, Jonathan Philbin, and Norman Adams. Orbit: An optimizing compiler for Scheme. In Proceedings of the 1986 Symposium on Compiler Construction, SIGPLAN Notices, Vol. 21, No 7, pages 219-233, Palo Alto, California, June 1986.
18. Peter J. Landin. The mechanical evaluation of expressions. Computer Journal, 6:308-320, 1964.
19. Drew McDermott. An efficient environment allocation scheme in an interpreter for a lexically-scoped Lisp. In Conference Record of the 1980 LISP Conference, pages 154-162, Stanford, California, August 1980.
20. Gordon D. Plotkin. Call-by-name, call-by-value and the fi-calculus. Theoretical Computer Science, 1:125-159, 1975.
21. Guy L Steele Jr. Rabbit: A compiler for Scheme. Technical Report AI-TR-474, Ar- ti_cial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978.
22. Christopher Strachey and Christopher P. Wadsworth. Continuations: A mathema- tical semantics for handling full jumps. Higher-Order and Symbolic Computation, 13(1/2), 2000. Reprint of the technical monograph PRG-11, Oxford University Computing Laboratory (1974).