Stability, Sequentiality and Demand Driven Evaluation in Dataflow
Arnon Avron, Nada Sasson · Formal Aspects of Computing · 1994
Abstract We show that a given dataflow language l has the property that for any program P and any demand for outputs D (which can be satisfied) there exists a least partial computation of P which satisfies D , iff all the operators of l are stable. This minimal computation is the demand-driven evaluation of P . We also argue that in order to actually implement this mode of evaluation, the operators of l should be further restricted to be effectively sequential ones.