Specification and correctness of lambda lifting

Journal of Functional Programming

Volumn 13, Issue 3, 2003, Pages 509-543

  Fischbach, Adam ^a   Hannan, John ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LAMBDA LIFTING ALGORITHMS;

ALGORITHMS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; RECURSIVE FUNCTIONS; SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0037851828     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796802004604     Document Type: Article

References (19)

1. Aspinall, D. (1995) Subtyping with singleton types. In: Pacholski, L. and Tiuryn, J. (eds.) Computer Science Logic: Lecture Notes in Computer Science 933, pp. 1-15. Springer-Verlag.
2. Bondorf, A. and Danvy, O. (1991) Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Computer Programming, 16(2), 151-195.
3. Clinger, W. and Hansen, L. T. (1994) Lambda, the ultimate label, or a simple optimizing compiler for scheme. In: Talcott, C., editor, Proceedings of ACM Conference on LISP and Functional Programming, pp. 128-139. ACM Press.
4. Danvy, O. (1998) An extensional characterization of lambda lifting. Technical report RS-98-2, BRICS.
5. Danvy, O. and Schultz, U. P. (2000) Lambda-dropping: transforming recursive equations into programs with block structure. Theor. Comput. Sci. 248(1-2), 243-287.
6. Fischbach, A. and Hannan, J. (2000) Specification and correctness of lambda lifting. In: Taha, W., editor, Semantics, Applications and Implementation of Program Generation: Lecture Notes in Computer Science 1924, pp. 108-128, Springer-Verlag.
7. Fischbach, A. and Hannan, J. (2001) Type systems and algorithms for useless-variable elimination. In: Danvy, O. and Filinski. A., editors. Programs as Data Objects: Lecture Notes in Computer Science 2053, pp. 25-38, Springer-Verlag.
8. Hannan, J. (1995) Type systems for closure conversions. In: Nielson. H. R. and Solberg. K. L. editors. Participants' Proceedings of the Workshop on Types for Program Analysis, pp. 48-62.
9. Hannan, J. (1998) A type-based escape analysis for functional languages. J. Functional Program. 8(3), 239-273.
10. Hannan, J. and Hicks, Pk. (1998) Higher-order arity raising. In: Hudak, P. and Qucinnec. C., editors. Proceedings Third International Conference on Functional Programming, pp. 27-38, ACM Press.
11. Hannan, J. and Hicks, P. (2000) Higher-order unCurrying. Higher-order & Symbolic Computation, 13(3), 179-216.
12. Hannan, J., Hicks, P. and Liben-Nowell, D. (1997) A lifetime analysis for higher-order languages. Technical report CSE-97-014. Penn State University.
13. Hughes, J. (1982) Super combinators: A new implementation method for applicative languages, In: Wise, D. S., editor. Proceedings ACM Symposium on LISP and Functional Programming, pp. 1-10. ACM Press.
14. Johnsson, T. (1985) Lambda lifting: Transforming programs to recursive equations. In: Jouannaud, J.-P., editor, Functional Programming Languages and Computer Architecture: Lecture Notes in Computer Science 201, pp. 190-203, Springer-Verlag.
15. Peyton Jones. S. L. (1987) The Implementation of Functional Programming Languages. Prentice Hall International Series in Computer Science. Prentice Hall.
16. Peyton Jones, S. L. and Lester, D. R. (1992) Implementing Functional Languages. Prentice Hall International Series in Computer Science. Prentice Hall.
17. Peyton Jones, S. L., Partain, W. and Santos, A. (1996) Let-floating: Moving bindings to give faster programs. In: Harper, R., editor, Proceedings ACM SIGPLAN International Conference on Functional Languages, pp. 1-12, ACM Press.
18. Shivers, O. (1991) Control-flow analysis of higher-order languages. PhD thesis. Carnegie-Mellon University.
19. Thiemann, P. (1999) ML-style typing, lambda lifting, and partial evaluation, Proceedings Latin American Conference on Functional Programming.