Abstract

We show that a given data ow language l has the property that for any program P and any demand for outputs D (which can be satis ed) there exists a least partial computation of P which satis es D, i 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 e ectively sequential ones