Show simple item record

dc.contributor.authorPingali, Keshaven_US
dc.contributor.authorArvinden_US
dc.date.accessioned2023-03-29T14:23:16Z
dc.date.available2023-03-29T14:23:16Z
dc.date.issued1983-09
dc.identifier.urihttps://hdl.handle.net/1721.1/149053
dc.description.abstractIn 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.ispartofseriesMIT-LCS-TM-243
dc.titleEfficient Demand-Driven Evaluation (II)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record