Efficient Demand-Driven Evaluation (II).
Keshav K. Pingali, Arvind Arvind · DSpace@MIT (Massachusetts Institute of Technology) · 1983
In Part I of this paper, we presented a scheme whereby a compiler could propogate demands through programs in a powerful stream language L. A data-driven evaluation of the transformed program performed exactly the same computation as a demand-driven evaluation of the original program. In this paper, we explore a different transformation which trades the complexity of demand propogation for a bounded amount of extra computation on some data lines.