Efficient Demand-Driven Evaluation (II)
| dc.contributor.author | Pingali, Keshav | en_US |
| dc.contributor.author | Arvind | en_US |
| dc.date.accessioned | 2023-03-29T14:23:16Z | |
| dc.date.available | 2023-03-29T14:23:16Z | |
| dc.date.issued | 1983-09 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149053 | |
| dc.description.abstract | 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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-243 | |
| dc.title | Efficient Demand-Driven Evaluation (II) | en_US |
