Lambda-lifting in quadratic time

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

Volumn 2441, Issue , 2002, Pages 134-151

  Danvy, Olivier ^a   Schultz, Ulrik P ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

BLOCK STRUCTURED; LOCAL FUNCTIONS; PROGRAM TRANSFORMATIONS; QUADRATIC TIME; RECURSIVE EQUATIONS; STRONGLY CONNECTED COMPONENT; TIME COMPLEXITY; TRANSITIVE CLOSURE;

PROGRAM COMPILERS;

EID: 33646730867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45788-7     Document Type: Conference Paper

References (34)

1. [1] Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986.
2. [2] Andrew W. Appel. Modern Compiler Implementation in {C, Java, ML}. Cambridge University Press, New York, 1998.
3. [3] Andrew W. Appel. SSA is functional programming. ACM SIGPLAN Notices, 33(4):17–20, April 1998.
4. [4] Andrew W. Appel and Trevor Jim. Continuation-passing, closure-passing style. In Michael J. O’Donnell and Stuart Feldman, editors, Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 293–302, Austin, Texas, January 1989. ACM Press.
5. [5] Andrew W. Appel and David B. MacQueen. Standard ML of New Jersey. In Jan MaHluszyński and Martin Wirsing, editors, 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. Springer-Verlag.
6. [6] Lennart Augustsson. A compiler for Lazy ML. In Guy L. Steele Jr., editor, Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, pages 218–227, Austin, Texas, August 1984. ACM Press.
7. Adam Bakewell and Colin Runciman. Automatic generalisation of function definitions. In Middeldorp and Sato [23], pages 225–240.
8. [8] Anders Bondorf and Olivier Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Computer Programming, 16:151–195, 1991.
9. William Clinger and Lars Thomas Hansen. Lambda, the ultimate label, or a simple optimizing compiler for Scheme. In Talcott [33], pages 128–139.
10. [10] Charles Consel. A tour of Schism: A partial evaluation system for higher-order applicative languages. In David A. Schmidt, editor, Proceedings of the Second ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 145–154, Copenhagen, Denmark, June 1993. ACM Press.
11. [11] Ole-Johan Dahl, Bjørn Myhrhaug, and Kristen Nygaard. Simula: Common Base Language. Norwegian Computing Center, October 1970.
12. Olivier Danvy. An extensional characterization of lambda-lifting and lambdadropping. In Middeldorp and Sato [23], pages 241–250. Extended version available as the technical report BRICS RS-99-21.
13. [13] Olivier Danvy and Ulrik P. Schultz. Lambda-dropping: Transforming recursive equations into programs with block structure. Theoretical Computer Science, 248(1-2):243–287, 2000.
14. [14] Olivier Danvy and Ulrik P. Schultz. Lambda-lifting in quadratic time. Technical Report BRICS RS-02-30, Department of Computer Science, University of Aarhus, Aarhus, Denmark, June 2002.
15. [15] Adam Fischbach and John Hannan. Specification and correctness of lambda lifting. In Walid Taha, editor, Proceedings of the First Workshop on Semantics, Applications, and Implementation of Program Generation (SAIG 2000), number 1924 in Lecture Notes in Computer Science, pages 108–128, Montréal, Canada, September 2000. Springer-Verlag.
16. [16] James Gosling, Bill Joy, and Guy Steele. The Java Language Specification. Addison-Wesley, 1996.
17. [17] John Hughes. Super combinators: A new implementation method for applicative languages. In Daniel P. Friedman and David S. Wise, editors, Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, pages 1–10, Pittsburgh, Pennsylvania, August 1982. ACM Press.
18. [18] Thomas Johnsson. Lambda lifting: Transforming programs to recursive equations. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architecture, number 201 in Lecture Notes in Computer Science, pages 190–203, Nancy, France, September 1985. Springer-Verlag.
19. [19] Thomas Johnsson. Compiling Lazy Functional Languages. PhD thesis, Department of Computer Sciences, Chalmers University of Technology, Göteborg, Sweden, 1987.
20. [20] Peter J. Landin. The mechanical evaluation of expressions. Computer Journal, 6:308–320, 1964.
21. [21] Ole L. Madsen, Birger Møller-Pedersen, and Kristen Nygaard. Object-oriented programming in the Beta programming language. Addison-Wesley, Reading, MA, USA, 1993.
22. Karoline Malmkjær, Nevin Heintze, and Olivier Danvy. ML partial evaluation using set-based analysis. In John Reppy, editor, Record of the 1994 ACM SIGPLAN Workshop on ML and its Applications, Rapport de recherche No 2265, INRIA, pages 112–119, Orlando, Florida, June 1994. Also appears as Technical report CMU-CS-94-129.
23. [23] Aart Middeldorp and Taisuke Sato, editors. Fourth Fuji International Symposium on Functional and Logic Programming, number 1722 in Lecture Notes in Computer Science, Tsukuba, Japan, November 1999. Springer-Verlag.
24. [24] Simon L. Peyton Jones. An introduction to fully-lazy supercombinators. In Guy Cousineau, Pierre-Louis Curien, and Bernard Robinet, editors, Combinators and Functional Programming Languages, number 242 in Lecture Notes in Computer Science, pages 176–208, Val d’Ajol, France, 1985. Springer-Verlag.
25. [25] Simon L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice Hall International Series in Computer Science. Prentice-Hall International, 1987.
26. [26] John Reppy. Local CPS conversion in a direct-style compiler. In Amr Sabry, editor, Proceedings of the Third ACM SIGPLAN Workshop on Continuations, Technical report 545, Computer Science Department, Indiana University, pages 1–6, London, England, January 2001.
27. [27] André Santos. Compilation by transformation in non-strict functional languages. PhD thesis, Department of Computing, University of Glasgow, Glasgow, Scotland, 1996.
28. [28] Ulrik P. Schultz. Object-Oriented Software Engineering Using Partial Evaluation. PhD thesis, University of Rennes I, Rennes, France, 2000.
29. [29] Ulrik P. Schultz. Partial evaluation for class-based object-oriented languages. In Olivier Danvy and Andrzej Filinski, editors, Programs as Data Objects, Second Symposium, PADO 2001, number 2053 in Lecture Notes in Computer Science, pages 173–197, Aarhus, Denmark, May 2001. Springer-Verlag.
30. [30] Ulrik P. Schultz, Julia Lawall, Charles Consel, and Gilles Muller. Towards automatic specialization of Java programs. In Rachid Guerraoui, editor, Proceedings of the European Conference on Object-oriented Programming (ECOOP’99), volume 1628 of Lecture Notes in Computer Science, pages 367–390, Lisbon, Portugal, June 1999. Springer-Verlag.
31. Zhong Shao and Andrew W. Appel. Space-efficient closure representations. In Talcott [33], pages 150–161.
32. [32] Paul A. Steckler and Mitchell Wand. Lightweight closure conversion. ACM Transactions on Programming Languages and Systems, 19(1):48–86, 1997.
33. [33] Carolyn L. Talcott, editor. Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, LISP Pointers, Vol. 7, No. 3, Orlando, Florida, June 1994. ACM Press.
34. [34] Mitchell Wand. From interpreter to compiler: a representational derivation. In Harald Ganzinger and Neil D. Jones, editors, Programs as Data Objects, number 217 in Lecture Notes in Computer Science, pages 306–324, Copenhagen, Denmark, October 1985. Springer-Verlag.