Lambda lifting: Transforming programs to recursive equations

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

Volumn 201 LNCS, Issue , 1985, Pages 190-203

  Johnsson, Thomas ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES;

COMBINATOR; FREE VARIABLE; FUNCTION DEFINITIONS; FUNCTIONAL PROGRAMS; GLOBAL FUNCTIONS; LOCAL FUNCTIONS; RECURSIVE EQUATIONS; REWRITE RULES;

FUNCTIONAL PROGRAMMING;

EID: 85034650378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-15975-4_37     Document Type: Conference Paper

References (8)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The design and Analysis of Algorithms, Addi son-Wesley, Reading, Mass. (1976).
2. L. Augustsson, "A Compiler for Lazy ML", pp. 218-227 in Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming, Austin (August 1984).
3. L. Augustsson, "Compiling Pattern Matching" in Proceedings 1985 Conference on Functional Programming Languages and Computer Architecture, Nancy, France (September 1985).
4. R. S. Bird, "Using Circular Programs to Eliminate Multiple Traverals of Data", Acta Informatica, Vol. 21, pp. 239-250 (1984).
5. J. Hughes, "Super Combinators -A New Implementation Method for Applicative Languages", pp. 1-10 in Proceedings of the 1982 ACM Symposium on Lisp and Functional Programming, Pittsburgh (1982).
6. T. Johnsson, "Efficient Compilation of Lazy Evaluation", pp. 58-69 in Proceedings of the SIGPLAN ’84 Symposium on Compiler Construction, Montreal (June 1984).
7. P. J. Landin, "The Next 700 Programming Languages", Communications of the ACM, Vol. 9 no. 3, pp. 157-164 (March 1966).
8. D. A. Turner, "A New Implementation Technique for Applicative Languages", Software -Practice and Experience, Vol. 9, pp. 31-49 (1979).