Communications of the ACM
A note on conditional expressions
Communications of the ACM
Correspondence between ALGOL 60 and Church's Lambda-notation: part I
Communications of the ACM
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Principles of proving concurrent programs in Gypsy
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A language design for structured concurrency
Proceedings of the DoD Sponsored Workshop on Design and Implementation of Programming Languages
An Approach to Fair Applicative Multiprogramming
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
First version of a data flow procedure language
Programming Symposium, Proceedings Colloque sur la Programmation
Parameter-passing mechanisms and nondeterminism
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A data flow language for operating systems programming
Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
LISP 1.5 Programmer's Manual
Parlog86 and the dining logicians
Communications of the ACM
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Systems programming in concurrent prolog
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A relational language for parallel programming
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Coordination Models Orc and Reo Compared
Electronic Notes in Theoretical Computer Science (ENTCS)
Concurrent applicative implementations of nondeterministic algorithms
Computer Languages
| Hi-index | 0.02 |
This paper proposes the encapsulization and control of contending parallel processes within data structures. The advantage of embedding the contention within data is that the contention, itself, thereby becomes an object which can be handled by the program at a level above the actions of the processes themselves. This means that an indeterminate behavior, never precisely specified by the programmer or by the input, may be shared in the same way that an argument to a function is shared by every use of the corresponding parameter, an ability which is of particular importance to applicative-style programming.