Abstract
G. Kahn in his IFIP's 1974 paper gave a straightforward denotational semantics of dataflow graphs by treating the history of an arc as a stream value, and a dataflow operator as a monotonic and continuous function from streams to streams. Operationally, a datadriven evaluation of dataflow graphs does not, in general, compute the total history of output arcs. We describe a program transformation technique whereby a data-driven evaluation of the transformed graph will perform exactly the same computation as a demand-driven evaluation of the original program. More importantly, the transformation technique suggests a simple denotational characterization for demand-driven evaluation. We hope this characterizationwill prove to be useful in designingefficient "lazy" interpreters.
Manuscript not received in time for inclusion in the proceedings.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arvind (1985). Demand-driven evaluation on dataflow machine. In: Maheshwari, S.N. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1985. Lecture Notes in Computer Science, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16042-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-16042-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16042-7
Online ISBN: 978-3-540-39722-9
eBook Packages: Springer Book Archive