The Essence of Compiling with Continuations

ACM SIGPLAN Notices

Volumn 28, Issue 6, 1993, Pages 237-247

  Flanagan, Cormac ^a   Sabry, Amr ^a   Duba, Bruce F ^a   Felleisen, Matthias ^b  

^a Rice University ^*

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976668242     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/173262.155113     Document Type: Article

References (21)

1. AHO, A., SETHI, R., AND ULLMAN, J. Compilers-Pnnciples, Techniques, and Tools. Addison-Wesley, Reading, Mass., 1985.
2. ApPEL, A. Compiling with Continuations. Cambridge University Press, 1992.
3. BARENDREGT, H. The Lambda Calculus: Its Syntax and Semantics, revised ed. Studies in Logic and the Foundations of Mathematics 103. NorthHolland, 1984.
4. BOEHM, H.-J., AND DEMERS, A. Implementing Russel. In Proceedzngs of the ACM SlGPLAN 1986 Symposmm on Compder Constructzon (1986), vol. 21(7), Sigplan Notices, pp. 186-195.
5. BONDORF, A. Improving binding times without explicit CPS-conversion. In Proceedings of the 1992 ACM Conference on Lzsp and Functional Programmzng (1992), pp. 1-10.
6. CLINGER, W. The Scheme 311 compiler: An exercise in denotational semantics. In Proceedings of the 1984 ACM Conference on Lzsp and Functional Programmzng (1984), pp. 356-364.
7. DANVY, O. Back to direct style. In Proceedzngs of the 4th European Symposium on Programmzng (Rennes, 1992), Lecture Notes in Computer Science, 582, Springer Verlag, pp. 130-150.
8. DANVY, O. Three steps for the CPS transformation. Tech. Rep. CIS-92-2, Kansas State University, 1992.
9. DANVY, O., AND FILINSKI, A. Representing control: A study of the CPS transformation. Mathematzcal Structures in Computer Science, 4 (1992),
10. FELLEISEN, M., AND FRIEDMAN, D. Control operators, the SECD-machine, and the A-calculus. In Formal Description of Programmzng Concepts III (Amsterdam, 1986), M. Wirsing, Ed., Elsevier Science Publishers B.V. (North-Holland), pp. 19:3-217.
11. FESSENDEN, C., CLINGER, W., FRIEDMAN, D. P., AND HAYNES, C. T. Scheme 311 version 4 reference manual. Computer Science Technical Report 137, Indiana University, Bloomington, Incliana, Feb. 1983.
12. FISCHER, M. Lambda calculus schemata. In Proceedings of the ACM Conference on Proving Assertwns About Programs (1972), vol. 7(1), Sigplan Notices, pp. 104-109.
13. KELSEY, R., AND HUDAK, P. Realistic compilation by program transformation. In Conference Record of the 16th Annual ACM Symposil1m on Princzples of Programming Languages (Austin, TX, Jan. 1989), pp. 281-292.
14. KRANZ, D., KELSEY, R., REES, J., HUDAK, P., PHILBIN, J., AND ADAMS, N. Orbit: optimizing compiler for Scheme. In Proceedzngs of the ACM SIGPLAN 1986 Symposium on Compiler Construction (1986), vol. 21(7), Sigplan Notices,
15. LEROY, X. The Zinc experiment: An economical implementation of the ML language. Tech. Rep. 117, INRIA, 1990.
16. PLOTKIN, G. Call-by-name, call-by-value, and the A-calculus. Theoretical Computer Science 1 (1975), 125-159.
17. SABRY, A., AND FELLEISEN, M. Reasoning about programs in continuation-passing style. In Proceedzngs of the 1992 ACM Conference on Lisp and Functwnal Programming (1992), pp. 288-298. Technical Report 92-180, Rice University.
18. SHIVERS, O. Control-Flow Analysis of HigherOrder Languages or Tamzng Lambda. PhD thesis, Carnegie-Mellon University, 1991.
19. STEELE, G. 1. RABBIT: A compiler for Scheme. MIT AI Memo 474, Massachusetts Institute of Technology, Cambridge, Mass., May 1978.
20. WAND, M. Correctness of procedure representations in higher-order assembly language. In Proceedzngs of the 1991 Conference on the Mathematical Foundations of Programing Semantics (1992), S. Brookes, Ed., vol. 598 of Lecture Notes zn Computer Sczence, Springer Verlag, pp. 294-311.
21. WEISE, D. Advanced compiling techniques. Course Notes at Stanford University, 1990.