On the criteria to be used in decomposing systems into modules
Communications of the ACM
Letters to the editor: go to statement considered harmful
Communications of the ACM
A preliminary architecture for a basic data-flow processor
25 years of the international symposia on Computer architecture (selected papers)
Data-Driven and Demand-Driven Computer Architecture
ACM Computing Surveys (CSUR)
An indeterminate constructor for applicative programming
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A History of Data-Flow Languages
IEEE Annals of the History of Computing
A preliminary architecture for a basic data-flow processor
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
An extensible architecture for data flow processing
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
Indeterminacy, monitors, and dataflow
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Resource management in dataflow
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
The design of usable programming languages
ACM '75 Proceedings of the 1975 annual conference
An extensible architecture for data flow processing
ACM SIGARCH Computer Architecture News
Parallel evolution programming language for data flow machines
ACM SIGPLAN Notices
Advances in dataflow programming languages
ACM Computing Surveys (CSUR)
Production systems as control structures for programming languages
ACM SIGART Bulletin
Performance of a Simulated Dataflow Computer
IEEE Transactions on Computers
A computer architecture for highly parallel signal processing
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
CARTESIAN STREAM TRANSFORMER COMPOSITION
Fundamenta Informaticae
Hi-index | 0.00 |
This paper describes a graphical programming language based on the concept of pure data flow sequencing of computations. Programs in this language are constructed through function definition and composition, and are based on the primitive notions of iteration, recursion, conditional expression, data replication, aggregation and selection, and the usual arithmetic and logical operations. Various useful programming devices such as the DO loop and, surprisingly, the memory cell are defined in terms of these primitives. Programs in this language are determinate in operation unless indeterminism is explicitly introduced. The utility of this language for designing and implementing operating systems is discussed.