CPS transformation of beta-redexes

Information Processing Letters

Volumn 94, Issue 5, 2005, Pages 217-224

  Danvy, Olivier ^a   Nielsen, Lasse R ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Continuation passing style (CPS); Fischer; Functional programming; Generalized reduction; One pass CPS transformation; Plotkin; Program derivation; Two level calculus

Indexed keywords

AUTOMATION; CLASSIFICATION (OF INFORMATION); CONTEXT FREE LANGUAGES; DIFFERENTIATION (CALCULUS); ENCODING (SYMBOLS); MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROGRAM COMPILERS;

CONTINUATION-PASSING STYLE (CPS); FISCHER; FUNCTIONAL PROGRAMMING; GENERALIZED REDUCTION; ONE-PASS CPS TRANSFORMATION; PROGRAM DERIVATION; TWO-LEVEL Γ-CALCULUS;

DYNAMIC PROGRAMMING;

EID: 18444412957     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.02.002     Document Type: Article

References (27)

1. A.W. Appel Compiling with Continuations 1992 Cambridge University Press New York
2. R. Bloo, F. Kamareddine, and R. Nederpelt The Barendregt cube with definitions and generalised reduction Inform. and Comput. 126 2 1996 123 143
3. D. Damian, and O. Danvy Syntactic accidents in program analysis: On the impact of the CPS transformation J. Funct. Programming 13 5 2003 867 904
4. O. Danvy A new one-pass transformation into monadic normal form G. Hedin Proc. 12th Internat. Conf. on Compiler Construction (CC 2003), Warsaw, Poland, April 2003 Lecture Notes in Comput. Sci. vol. 2622 2003 Springer-Verlag Berlin 77 89
5. O. Danvy, and A. Filinski Representing control, a study of the CPS transformation Math. Structures Comput. Sci. 2 4 1992 361 391
6. O. Danvy, and L.R. Nielsen A higher-order colon translation H. Kuchen K. Ueda Proc. 5th Internat. Symp. on Functional and Logic Programming (FLOPS 2001), Tokyo, Japan, March 2001 Lecture Notes in Comput. Sci. vol. 2024 2001 Springer-Verlag Berlin 78 91
7. M.J. Fischer Lambda-calculus schemata LISP and Symbolic Comput. 6 3-4 1993 259 288 http://www.brics.dk/~hosc/vol06/03-fischer.html Earlier version available Proc. ACM Conf. on Proving Assertions about Programs SIGPLAN Notices 7 1 1972
8. Earlier version available Proc. ACM Conf. on Proving Assertions about Programs SIGPLAN Notices 7 1 1972
9. C. Flanagan, A. Sabry, B.F. Duba, and M. Felleisen The essence of compiling with continuations D.W. Wall Proc. ACM SIGPLAN'93, Conf. on Programming Languages Design and Implementation, Albuquerque, NM, June 1993 SIGPLAN Notices 28 6 1993 237 247
10. D.P. Friedman, M. Wand, and C.T. Haynes Essentials of Programming Languages 1991 MIT Press/McGraw-Hill Cambridge, MA/New York
11. J. Hannan, and P. Hicks Higher-order uncurrying Higher-Order and Symbolic Comput. 13 3 2000 179 218
12. J. Hatcliff, The structure of continuation-passing styles, PhD thesis, Department of Computing and Information Sciences, Kansas State University, Manhattan, KS, June 1994
13. J. Hatcliff, and O. Danvy A generic account of continuation-passing styles H.-J. Boehm Proc. 21st Annual ACM Symp. on Principles of Programming Languages, Portland, OR, January 1994 1994 ACM Press New York 458 471
14. D. Kranz, R. Kesley, J. Rees, P. Hudak, J. Philbin, and N. Adams Orbit: An optimizing compiler for Scheme Proc. ACM SIGPLAN'86, Symp. on Compiler Construction, Palo Alto, CA, June 1986 1986 ACM Press New York 219 233
15. J.L. Lawall, and O. Danvy Continuation-based partial evaluation C.L. Talcott Proc. 1994 ACM Conf. on Lisp and Functional Programming, Orlando, FL, June 1994 LISP Pointers VII 3 1994 227 238
16. E. Moggi Notions of computation and monads Inform. and Comput. 93 1991 55 92
17. L.R. Nielsen, A study of defunctionalization and continuation-passing style, PhD thesis, BRICS PhD School, University of Aarhus, Aarhus, Denmark, July 2001. BRICS DS-01-7
18. F. Nielson, and H.R. Nielson Two-Level Functional Languages Cambridge Tracts in Theoretical Computer Science vol. 34 1992 Cambridge University Press Cambridge, MA
19. G.D. Plotkin Call-by-name, call-by-value and the λ-calculus Theoret. Comput. Sci. 1 1975 125 159
20. J.C. Reynolds The discoveries of continuations Lisp and Symbolic Comput. 6 3-4 1993 233 247
21. A. Sabry, The formal relationship between direct and continuation-passing style optimizing compilers: a synthesis of two paradigms, PhD thesis, Computer Science Department, Rice University, Houston, TX, August 1994. Technical report 94-242
22. A. Sabry, and M. Felleisen Reasoning about programs in continuation-passing style Lisp and Symbolic Comput. 6 3-4 1993 289 360
23. O. Shivers, Control-flow analysis of higher-order languages or taming lambda, PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 1991. Technical Report CMU-CS-91-145
24. G.L. Steele Jr., Rabbit: A compiler for Scheme, Master's thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, May 1978. Technical report AI-TR-474
25. H. Thielecke, Categorical structure of continuation passing style, PhD thesis, University of Edinburgh, Edinburgh, Scotland, 1997. ECS-LFCS-97-376
26. C.P. Wadsworth Continuations revisited Higher-Order and Symbolic Comput. 13 1-2 2000 131 133
27. M. Wand Correctness of procedure representations in higher-order assembly language S. Brookes M. Main A. Melton M. Mislove D. Schmidt Proc. 7th Internat. Conf. on Mathematical Foundations of Programming Semantics, Pittsburgh, PA, March 1991 Lecture Notes in Comput. Sci. vol. 598 1991 Springer-Verlag Berlin 294 311