Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
- 1 March 1988
- journal article
- Published by Springer Nature in New Generation Computing
- Vol. 5 (4) , 377-391
- https://doi.org/10.1007/bf03037416
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Partial parametrization eliminates multiple traversals of data structuresActa Informatica, 1987
- Lambda lifting: Transforming programs to recursive equationsPublished by Springer Nature ,1985
- Miranda: A non-strict functional language with polymorphic typesLecture Notes in Computer Science, 1985
- Efficient compilation of lazy evaluationPublished by Association for Computing Machinery (ACM) ,1984
- Recursion Equations as a Programming LanguagePublished by Springer Nature ,1982
- A fixed-program machine for combinator expression evaluationPublished by Association for Computing Machinery (ACM) ,1982
- Super-combinators a new implementation method for applicative languagesPublished by Association for Computing Machinery (ACM) ,1982
- Fourth international colloquium on automata, languages and programmingTheoretical Computer Science, 1976
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974
- The next 700 programming languagesCommunications of the ACM, 1966