Dataflow computing and Eager and Lazy evaluations

DOI10.1007/BF03037098zbMATH Open0595.68028MaRDI QIDQ1077928FDOQ1077928

Authors: Makoto Amamiya, Ryuzo Hasegawa 

Publication date: 1984

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

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

zbMATH Keywords

stream processinglist processingdataflow modeldemand drivenEager and lazy evaluationslazy conslenient cons

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• PARLOG: parallel programming in logic
• Title not available (Why is that?)
• Guarded commands, nondeterminacy and formal derivation of programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• Functional programming with combinators
• Eager functions as processes
• Title not available (Why is that?)
• The expressive power of indeterminate dataflow primitives
• Stability, sequentiality and demand driven evaluation in dataflow

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)