A first-order one-pass CPS transformation

Theoretical Computer Science

Volumn 308, Issue 1-3, 2003, Pages 239-257

  Danvy, Olivier ^a   Nielsen, Lasse R ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

calculus; Administrative reductions; Continuation passing style (CPS); Continuations

Indexed keywords

COMPUTATION THEORY; SET THEORY; THEOREM PROVING;

CONTINUATIONS;

MATHEMATICAL TRANSFORMATIONS;

EID: 0142149153     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00733-8     Document Type: Article

References (46)

1. Appel A.W. Compiling with Continuations. 1992;Cambridge University Press, New York.
2. H. Barendregt, The Lambda Calculus: its Syntax and Semantics, Studies in Logic and the Foundation of Mathematics, Revised Edition, Vol. 103, North-Holland, Amsterdam, 1984.
3. Clinger W.D. Proper tail recursion and space efficiency. Cooper K.D. Proc. ACM SIGPLAN'98 Conf. on Programming Languages Design and Implementation, Montréal, Canada. June 1998;174-185 ACM Press, Metals Park.
4. D. Damian, On static and dynamic control-flow information in program analysis and transformation, Ph.D. Thesis, BRICS Ph.D. School, University of Aarhus, Aarhus, Denmark, July 2001, BRICS DS-01-5.
5. Damian D., Danvy O. A simple CPS transformation of control-flow information. Logic J. IGPL. 10:2002;501-515.
6. D. Damian, O. Danvy, Syntactic accidents in program analysis: on the impact of the CPS transformation, J. Funct. Programming, 2002, Extended version available as the Tech. Report BRICS-RS-01-54, to appear.
7. Danvy O. Back to direct style. Sci. Comput. Programming. 22(3):1994;183-195.
8. Danvy O. Formalizing implementation strategies for first-class continuations. Smolka G. Proc. 9th European Symp. on Programming. Lecture Notes in Computer Science. Vol. 1782:March 2000;88-103 Springer, Berlin, Germany.
9. O. Danvy, B. Dzafic, F. Pfenning. On proving syntactic properties of CPS programs, in: 3rd Internat. Workshop on Higher-Order Operational Techniques in Semantics, Electronic Notes in Theoretical Computer Science, Vol. 26, Paris, France, September 1999, pp. 19-31, also available as the Tech. Report BRICS RS-99-23.
10. Danvy O., Filinski A. Representing control, a study of the CPS transformation. Math. Struct. Comput. Sci. 2(4):1992;361-391.
11. O. Danvy, L.R. Nielsen, CPS transformation of beta-redexes, in: A. Sabry (Ed.), Proc. 3rd ACM SIGPLAN Workshop on Continuations, Tech. Report 545, Computer Science Department, Indiana University, London, England, January 2001, pp. 35-39, also available as the Tech. Report BRICS RS-00-35.
12. O. Danvy, L.R. Nielsen, Defunctionalization at work, in: H. Søndergaard (Ed.), Proc. 3rd Internat. Conf. on Principles and Practice of Declarative Programming, Firenze, Italy, ACM Press, Metals Park, September 2001, pp. 162-174, Extended version available as the Tech. Report BRICS RS-01-23.
13. O. Danvy, L.R. Nielsen, A higher-order colon translation, in: H. Kuchen, K. Ueda (Eds.), Functional and Logic Programming, 5th Internat. Symp., FLOPS 2001, Lecture Notes in Computer Science, Vol. 2024, Tokyo, Japan, Springer, Berlin, March 2001, pp. 78-91, Extended version available as the Tech. Report BRICS RS-00-33.
14. O. Danvy, L.R. Nielsen, Syntactic theories in practice, in: M. van den Brand, R.M. Verma, (Eds.), Informal Proceedings 2nd Internat. Workshop on Rule-Based Programming (RULE 2001), Electronic Notes in Theoretical Computer Science, Vol. 59.4, Firenze, Italy, September 2001, Extended version available as the Tech. Report BRICS RS-02-04.
15. O. Danvy, F. Pfenning, The occurrence of continuation parameters in CPS terms, Tech. Report CMU-CS-95-121, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, February 1995.
16. B. Dzafic, Formalizing program transformations, Master's Thesis, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, December 1998.
17. M. Felleisen, The calculi of λ-v-CS conversion: a syntactic theory of control and state in imperative higher-order programming languages, Ph.D. Thesis, Department of Computer Science, Indiana University, Bloomington, Indiana, August 1987.
18. Friedman D.P., Wand M., Haynes C.T. Essentials of Programming Languages. 1991;The MIT Press, McGraw-Hill, Cambridge, New York.
19. Friedman D.P., Wand M., Haynes C.T. Essentials of Programming Languages. 2nd Edition:2001;The MIT Press, Cambridge, MA.
20. J. Hatcliff, The structure of continuation-passing styles, Ph.D. Thesis, Department of Computing and Information Sciences, Kansas State University, Manhattan, Kansas, June 1994.
21. Hatcliff J., Danvy O. A generic account of continuation-passing styles. Boehm H.J. Proc. 21st Ann. ACM Symp. on Principles of Programming Languages, Portland, Oregon. January 1994;458-471 ACM Press, New York.
22. J.-T. Kim, K. Yi, Interconnecting between CPS terms and non-CPS terms, in: A. Sabry (Ed.), Proc. Third ACM SIGPLAN Workshop on Continuations, Tech. Report 545, Computer Science Department, Indiana University, London, England, January 2001, pp. 7-16.
23. D. Kranz, R. Kesley, J. Rees, P. Hudak, J. Philbin, N. Adams, Orbit: an optimizing compiler for Scheme, in: Proc. ACM SIGPLAN'86 Symp. on Compiler Construction, Palo Alto, CA, ACM Press, New York, June 1986, pp. 219-233.
24. A.R. Meyer, M. Wand, Continuation semantics in typed lambda-calculi (summary), in: R. Parikh (Ed.), Logics of Programs - Proc. Lecture Notes in Computer Science, Vol. 193, Brooklyn, New York, Springer, Berlin, June 1985, pp. 219-224.
25. Moggi E. Notions of computations and monads. Inform. Comput. 93:1991;55-92.
26. Morrisett G., Walker D., Crary K., Glew N. From system F to typed assembly language. ACM Trans. Programming Languages Systems. 21(3):1999;527-568.
27. L.R. Nielsen, A study of defunctionalization and continuation-passing style, Ph.D. Thesis, BRICS Ph.D. School, University of Aarhus, Aarhus, Denmark, July 2001, BRICS DS-01-7.
28. L.R. Nielsen, A simple correctness proof of the direct-style transformation, Tech. Report BRICS RS-02-02, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, January 2002.
29. I. Ogata, A CPS-transform of constructive classical logic, in: P.S. Thiagarajan, R.H.C. Yap (Eds.), Advances in Computing Science - ASIAN'99, 5th Asian Computing Science Conf., Lecture Notes in Computer Science, Vol. 1742, Phuket, Thailand, Springer, Berlin, December 1999, pp. 266-280.
30. J. Palsberg, M. Wand, CPS transformation of flow information, J. Funct. Programming, 2002, to appear.
31. Plotkin G.D. Call-by-name, call-by-value and the. λ -calculus Theoret. Comput. Sci. 1:1975;125-159.
32. J. Polakow, Ordered Linear Logic and Applications, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, August 2001, Tech. Report CMU-CS-01-152.
33. J. Polakow, F. Pfenning, Natural deduction for intuitionistic non-commutative linear logic, in: J.-Y. Girard (Ed.), Proc. 4th Internat. Conf. on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, Vol. 1581, L'Aquila, Italy, Springer, Berlin, April 1999, pp. 295-309.
34. J. Polakow, F. Pfenning, Properties of terms in continuation passing style in an ordered logical framework, in: J. Despeyroux (Ed.), Workshop on logical Frameworks and Meta-Languages (LFM 2000), Santa Barbara, CA, June 2000, http://www-sop.inria.fr/certilab/LFM00/Proceedings/.
35. J. Polakow, K. Yi, Proving syntactic properties of exceptions in an ordered logical framework, in: H. Kuchen, K. Ueda (Eds.), Functional and Logic Programming, 5th Internat. Symp., FLOPS 2001, Lecture Notes in Computer Science, Vol. 2024, Tokyo, Japan, Springer, Berlin, March 2001, pp. 61-77.
36. Reynolds J.C. The discoveries of continuations. Lisp Symbol. Comput. 6(3/4):1993;233-247.
37. J.C. Reynolds, Definitional interpreters for higher-order programming languages, Higher-Order Symbol. Comput. 11 (4) (1998) 363-397, Reprinted from the Proc. 25th ACM National Conference, 1972.
38. A. Sabry, The formal relationship between direct and continuation passing style optimizing compilers: a synthesis of two paradigms, Ph.D. Thesis, Computer Science Department, Rice University, Houston, TX, August 1994, Tech. Report 94-242.
39. Sabry A., Felleisen M. Reasoning about programs in continuation-passing style. Lisp Symbol. Comput. 6(3/4):1993;289-360.
40. Sabry A., Wadler P. A reflection on call-by-value. ACM Trans. Programming Languages Systems. 19(6):1997;916-941.
41. G.L. Steele Jr. Rabbit: a compiler for Scheme, Master's Thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978, Tech. Report AI-TR-474.
42. Wand M. Embedding type structure in semantics. Van Deusen M.S., Galil Z. Proc. 12th Ann. ACM Symp. on Principles of Programming Languages, New Orleans, Louisiana. January 1985;1-6 ACM Press, New York.
43. M. Wand, Correctness of procedure representations in higher-order assembly language, in: S. Brookes, M. Main, A. Melton, M. Mislove, D. Schmidt (Eds.), Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, Vol. 598, Pittsburgh, Pennsylvania, Springer, Berlin, March 1991, pp. 294-311; Proc. 7th International Conference.
44. M. Wand, Correctness of procedure representations in higher-order assembly language, in: S. Brookes, M. Main, A. Melton, M. Mislove, D. Schmidt (Eds.), Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, Vol. 598, Pittsburgh, Pennsylvania, Springer, Berlin, March 1991, pp. 294-311; Proc. 7th International Conference.
45. G. Winskel, The Formal Semantics of Programming Languages, Foundation of computing series, The MIT Press, Cambridge, 1993.
46. Zdancewic S., Myers A. Secure information flow via linear continuations. Higher-Order Symbol. Comput. 15(2/3):2002;209-234.