Dataflow computing and Eager and Lazy evaluations

DOI10.1007/BF03037098MaRDI QIDQ1077928zbMATH OpenFDO

Authors Makoto Amamiya, Ryuzo Hasegawa

Publication date 1984

Published in New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

stream processinglist processingdataflow modeldemand drivenEager and lazy evaluationslazy conslenient cons

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• More haste, less speed: lazy versus eager evaluation
• Dataflow computing models, languages, and machines for intelligence computations
• scientific article; zbMATH DE number 3930323
• Lenient evaluation and parallelism
• Efficient demand-driven evaluation. Part 2

Cites work

• scientific article; zbMATH DE number 3825153 (Why is no real title available?)
• scientific article; zbMATH DE number 3963187 (Why is no real title available?)
• scientific article; zbMATH DE number 3748392 (Why is no real title available?)
• scientific article; zbMATH DE number 3469994 (Why is no real title available?)
• scientific article; zbMATH DE number 194376 (Why is no real title available?)
• Guarded commands, nondeterminacy and formal derivation of programs
• PARLOG: parallel programming in logic

Cited in

(6)

• Eager functions as processes
• The expressive power of indeterminate dataflow primitives
• scientific article; zbMATH DE number 3890700 (Why is no real title available?)
• scientific article; zbMATH DE number 3903943 (Why is no real title available?)
• Stability, sequentiality and demand driven evaluation in dataflow
• Functional programming with combinators

Describes a project that uses

Uses Software

• PARLOG

This page was built for publication: Dataflow computing and Eager and Lazy evaluations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077928)