The denotational semantics of programming languages
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Mathematical semantics and data flow programming
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
A fixpoint semantics for nondeterministic data flow
Journal of the ACM (JACM)
A fully abstract trace model for dataflow networks
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
The usage of stochastic processes in embedded system specifications
Proceedings of the ninth international symposium on Hardware/software codesign
Consistency in Dataflow Graphs
IEEE Transactions on Parallel and Distributed Systems
Advances in dataflow programming languages
ACM Computing Surveys (CSUR)
A fully abstract trace model for dataflow and asynchronous networks
Distributed Computing
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
| Hi-index | 0.00 |
Data flow programming languages are especially amenable to mathematization of their semantics in the denotational style of Scott and Strachey. However, many real world programming problems, such as operating systems and data base inquiry systems, require a programming language capable of non-determinacy because of the non-determinate behavior of their physical environment. To date, there has been no satisfactory denotational semantics of programming languages with non-determinacy. This paper presents a straightforward denotational treatment of non-determinate data flow programs as functions from sets of tagged sequences to sets of tagged sequences. A simple complete partial order on such sets exists, in which the data flow primitives are continuous functions, so that any data flow program computes a well defined function.