Code optimizations for lazy evaluation
- 1 September 1988
- journal article
- Published by Springer Nature in Higher-Order and Symbolic Computation
- Vol. 1 (2) , 147-164
- https://doi.org/10.1007/bf01806169
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A collecting interpretation of expressionsPublished by Association for Computing Machinery (ACM) ,1988
- Path semanticsPublished by Springer Nature ,1988
- Compiling strictness into streamsPublished by Association for Computing Machinery (ACM) ,1987
- Tim: A simple, lazy abstract machine to execute supercombinatorsPublished by Springer Nature ,1987
- The theory of strictness analysis for higher order functionsPublished by Springer Nature ,1986
- Higher-order strictness analysis in untyped lambda calculusPublished by Association for Computing Machinery (ACM) ,1986
- MULTILISP: a language for concurrent symbolic computationACM Transactions on Programming Languages and Systems, 1985
- Efficient compilation of lazy evaluationACM SIGPLAN Notices, 1984
- Complexity of flow analysis, inductive assertion synthesis and a language due to DijkstraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977