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.
Original language | English |
---|---|
Pages (from-to) | 620-642 |
Number of pages | 23 |
Journal | Formal Aspects of Computing |
Volume | 6 |
Issue number | 6 |
DOIs | |
State | Published - Dec 1994 |
Keywords
- Dataflow
- Sequentiality
- Stability