Defunctionalization at work

Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2001, Pages 162-174

  Danvy, Olivier ^a   Nielsen, Lasse R ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Church encoding; Closure conversion; Continuation passing style (CPS); Continuations; CPS transformation; Defunctionalization; Direct style transformation; First order programs; Higher order programs; Lambda lifting; ML; Regular expressions; Scheme

Indexed keywords

DATA STRUCTURES; FORMAL LOGIC; SUBROUTINES;

SUPERCOMBINATOR CONVERSION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0035790510     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773184.773202     Document Type: Conference Paper

References (56)

1. A. W. Appel and T. Jim. Continuation-passing, closure-passing style. In M. J. O'Donnell and S. Feldman, editors, Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 293-302, Austin, Texas, Jan. 1989. ACM Press.
2. A. Banerjee, N. Heintze, and J. G. Riecke. Semantics-based design and correctness of control-flow analysis-based program transformations. Unpublished, Mar. 2001.
3. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundation of Mathematics. North-Holland, 1984. Revised edition.
4. J. M. Bell, F. Bellegarde, and J. Hook. Type-driven defunctionalization. In M. Tofte, editor, Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 25-37, Amsterdam, The Netherlands, June 1997. ACM Press.
5. A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, 1990. DIKU Rapport 90/17.
6. U. Boquist. Code Optimization Techniques for Lazy Functional Languages. PhD thesis, Department of Computing Science, Chalmers University of Technology, Göteborg University, Göteborg, Sweden, Apr. 1999.
7. H. Cejtin, S. Jagannathan, and S. Weeks. Flow-directed closure conversion for typed languages. In Smolka [46], pages 56-71.
8. W. Chen, M. Kifer, and D. S. Warren. Hilog: A foundation for higher-order logic programming. The Journal of Logic Programming, 15(3):187-230, 1993.
9. A. Church. The Calculi of Lambda-Conversion. Princeton University Press, 1941.
10. O. Danvy. Back to direct style. Science of Computer Programming, 22(3):183-195, 1994.
11. O. Danvy. Formalizing implementation strategies for first-class continuations. In Smolka [46], pages 88-103.
12. O. Danvy and A. Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
13. O. Danvy, B. Grobauer, and M. Rhiger. A unifying approach to goal-directed evaluation. In W. Taha, editor, Proceedings of the Second Workshop on Semantics, Applications, and Implementation of Program Generation (SAIG 2001), Lecture Notes in Computer Science, Florence, Italy, Sept. 2001. Springer-Verlag. To appear.
14. O. Danvy and J. L. Lawall. Back to direct style II: First-class continuations. In W. Clinger, editor, Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, LISP Pointers, Vol. V, No. 1, pages 299-310, San Francisco, California, June 1992. ACM Press.
15. O. Danvy and F. Pfenning. The occurrence of continuation parameters in CPS terms. Technical report CMU-CS-95-121, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, Feb. 1995.
16. E. W. Dijkstra. Recursive programming. In S. Rosen, editor, Programming Systems and Languages, chapter 3C, pages 221-227. McGraw-Hill, New York, 1960.
17. R. K. Dybvig. Three Implementation Models for Scheme. PhD thesis, Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina, Apr. 1987. Technical Report #87-011.
18. L. Fegaras. lambda-DB. Available online at http://lambda.uta.edu/lambda-DB/manual/,1999-2001.
19. M. Felleisen. The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. PhD thesis, Department of Computer Science, Indiana University, Bloomington, Indiana, Aug. 1987.
20. D. P. Friedman, M. Wand, and C. T. Haynes. Essentials of Programming Languages, second edition. The MIT Press, 2001.
21. J.-Y. Girard. Locus solum. Mathematical Structures in Computer Science, 11(3), 2001. To appear.
22. J. A. Goguen, J. W. Thatcher, and E. G. Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. In Current Trends in Programming Methodology, volume IV, pages 80-149. Prentice-Hall, 1978.
23. A. Goldberg and D. Robson. Smalltalk-80: The Language and its Implementation. Addison-Wesley, 1983.
24. M. Goldberg. Recursive Application Survival in the λ-Calculus. PhD thesis, Computer Science Department, Indiana University, Bloomington, Indiana, May 1996.
25. R. Harper. Proof-directed debugging. Journal of Functional Programming, 9(4):463-469, July 1999.
26. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
27. J. Hughes. Super combinators: A new implementation method for applicative languages. In D. P. Friedman and D. S. Wise, editors, Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, pages 1-10, Pittsburgh, Pennsylvania, Aug. 1982. ACM Press.
28. J. Hughes. A novel representation of lists and its application to the function "reverse". Information Processing Letters, 22(3):141-144, 1986.
29. T. Johnsson. Lambda lifting: Transforming programs to recursive equations. In J.-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, number 201 in Lecture Notes in Computer Science, pages 190-203, Nancy, France, Sept. 1985. Springer-Verlag.
30. P. J. Landin. The mechanical evaluation of expressions. Computer Journal, 6:308-320, 1964.
31. C. Mellish and S. Hardy. Integrating Prolog in the POPLOG environment. In J. A. Campbell, editor, Implementations of PROLOG, pages 147-162. Ellis Horwood, 1984.
32. Y. Minamide, G. Morrisett, and R. Harper. Typed closure conversion. In G. L. Steele Jr., editor, Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, pages 271-283, St. Petersburg Beach, Florida, Jan. 1996. ACM Press.
33. T. A. Mogensen. Efficient self-interpretation in lambda calculus. Journal of Functional Programming, 2(3):345-363, 1992.
34. T. Nicholson and N. Y. Foo. A denotational semantics for Prolog. ACM Transactions on Programming Languages and Systems, 11(4):650-665, Oct. 1989.
35. L. R. Nielsen. A denotational investigation of defunctionalization. Progress report (superseded by [36]), BRICS PhD School, University of Aarhus, June 1999.
36. L. R. Nielsen. A denotational investigation of defunctionalization. Technical Report BRICS RS-00-47, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, Dec. 2000.
37. S. L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice Hall International Series in Computer Science. Prentice-Hall International, 1987.
38. S. L. Peyton Jones and D. R. Lester. Implementing Functional Languages. Prentice Hall International Series in Computer Science. Prentice-Hall, 1992.
39. J. Polakow. Linear logic programming with ordered contexts. In M. Gabbrielli and F. Pfenning, editors, Proceedings of the Second International Conference on Principles and Practice of Declarative Programming, pages 68-79, Montréal, Canada, Sept. 2000. ACM Press.
40. J. Polakow and K. Yi. Proving syntactic properties of exceptions in an ordered logical framework. In H. Kuchen and K. Ueda, editors, Fifth International Symposium on Functional and Logic Programming, number 2024 in Lecture Notes in Computer Science, pages 61-77, Tokyo, Japan, Mar. 2001. Springer-Verlag.
41. T. A. Proebsting. Simple translation of goal-directed evaluation. In R. K. Cytron, editor, Proceedings of the ACM SIGPLAN'97 Conference on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 32, No 5, pages 1-6, Las Vegas, Nevada, June 1997. ACM Press.
42. J. C. Reynolds. The essence of Algol. In van Vliet, editor, International Symposium on Algorithmic Languages, pages 345-372, Amsterdam, The Netherlands, 1982. North-Holland.
43. J. C. Reynolds. Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation, 11(4):363-397, 1998. Reprinted from the proceedings of the 25th ACM National Conference (1972).
44. J.C. Reynolds. Definitional interpreters revisited. Higher-Order and Symbolic Computation, 11(4):355-361, 1998.
45. O. Shivers. Control-Flow Analysis of Higher-Order Languages or Taming Lambda. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 1991. Technical Report CMU-CS-91-145.
46. G. Smolka, editor. Proceedings of the Ninth European Symposium on Programming, number 1782 in Lecture Notes in Computer Science, Berlin, Germany, Mar. 2000. Springer-Verlag.
47. P. A. Steckler and M. Wand. Lightweight closure conversion. ACM Transactions on Programming Languages and Systems, 19(1):48-86, Jan. 1997.
48. G. L. Steele Jr. Rabbit: A compiler for Scheme. Technical Report AI-TR-474, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978.
49. C. Strachey. Fundamental concepts in programming languages. Higher-Order and Symbolic Computation, 13(1/2):1-49, 2000.
50. A. Tolmach and D. P. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Programming, 8(4):367-412, 1998.
51. D. A. Turner. A new implementation technique for applicative languages. Software-Practice and Experience, 9(1):31-49, 1979.
52. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Comput. Sci., 73(2):231-248, 1989.
53. M. Wand. Continuation-based program transformation strategies. J. ACM, 27(1):164-180, Jan. 1980.
54. D. C. Wang and A. W. Appel. Type-safe garbage collectors. In H. R. Nielson, editor, Proceedings of the Twenty-Eighth Annual ACM Symposium on Principles of Programming Languages, pages 166-178, London, United Kingdom, Jan. 2001. ACM Press.
55. G. Winskel. The Formal Semantics of Programming Languages. Foundation of Computing Series. The MIT Press, 1993.
56. Y. Xiao, A. Sabry, and Z. M. Ariola. From syntactic theories to interpreters: Automating proofs of decomposition lemma. Higher-Order and Symbolic Computation, 14(4), 2001. To appear.