Specification and Correctness of Lambda Lifting?

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

Volumn 1924, Issue , 2000, Pages 108-128

  Fischbach, Adam ^a   Hannan, John ^a  

^a The Center for Nanotechnology Education and Utilization   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROGRAMMING; SEMANTICS; SPECIFICATIONS;

FUNCTION CALLS; GENERAL SPECIFICATION; IMPLEMENTATION TECHNIQUES; OPERATION SUPPORT; OPERATIONAL SEMANTICS; PROGRAM TRANSFORMATIONS; RECURSIVE EQUATIONS;

APPLICATION PROGRAMS;

EID: 84957797233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45350-4_10     Document Type: Conference Paper

References (17)

1. Clinger, W., and Hansen, L. T. Lambda, the ultimate label, or a simple optimizing compiler for scheme. In 1994 Conference on Lisp and Functional Pro-gramming (1994), C. Talcott, Ed., ACM Press, pp. 128-139.
2. Danvy, O. An extensional characterization of lambda lifting. Tech. Rep. RS-98-2, BRICS, January 1998.
3. Danvy, O., and Schultz, U. P. Lambda dropping: Transforming recursive equa-tions into programs with block structure. Tech. Rep. RS-99-27, BRICS, September 1999. To appear in the November 2000 issue of Theoretical Computer Science.
4. Hannan, J. Type systems for closure conversions. In Participants' Proceedings of the Workshop on Types for Program Analysis (May 1995), H. R. Nielson and K. L. Solberg, Eds., Aarhus University, DAIMI PB-493, pp. 48-62.
5. Hannan, J. A type-based escape analysis for functional languages. Journal of Functional Programming 8, 3 (May 1998).
6. Hannan, J., and Hicks, P. Live variable analysis using types. In Workshop on Types in Compilation (1997), Computer Science Department, Boston College. Available as a technical report.
7. Hannan, J., and Hicks, P. Higher-order arity raising. In Proceedings of the Third International Conference on Functional Programming (September 1998), P. Hudak and C. Queinnec, Eds., ACM SIGPLAN, pp. 27-38.
8. Hannan, J., and Hicks, P. Higher-order unCurrying. In Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (January 1998), pp. 1-11.
9. Hughes, J. Super combinators: A new implementation method for applicative lan-guages. In Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming (August 1982), D. S. Wise, Ed., pp. 1-10.
10. Johnsson, T. Lambda lifting: Transforming programs to recursive equations. In Functional Programming Languages and Computer Architecture (1985), J.-P. Jouannaud, Ed., vol. 201 Of Lecture Notes in Computer Science, Springer Verlag, pp. 190-203.
11. Milner, R., and Tofte, M. Co-induction in relational semantics. Theoretical Computer Science 87, 1 (1991), 209-220.
12. Peyton Jones, S. L. The Implementation of Functional Programming Languages. Prentice Hall International Series in Computer Science. Prentice Hall International, 1987.
13. Peyton Jones, S. L., and Lester, D. R. Implementing Functional Languages. Prentice Hall International Series in Computer Science. Prentice Hall International, 1992.
14. Peyton Jones, S. L., Partain, W., and Santos, A. Let-floating: Moving bind-ings to give faster programs. In Proceedings of the ACM SIGPLAN International Conference on Functional Languages (1996), R. Harper, Ed., pp. 1-12.
15. Shao, Z., and Appel, A. Space-eficient closure representations. In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming (June 1994), pp. 150-161.
16. Shivers, O. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie-Mellon University, May 1991.
17. Wand, M., and Steckler, P. Lightweight Closure Conversion. In ACM Trans-actions on Programming Languages and Systems (January 1997), pp. 48-86.