Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Separating concurrent languages with categories of language embeddings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An efficiency preorder for processes
Acta Informatica
A calculus of mobile processes, I
Information and Computation
Embedding as a tool for language comparison
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Bisimulation for higher-order process calculi
Information and Computation
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Comparing three semantics for Linda-like languages
Theoretical Computer Science
Theoretical Computer Science
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Information and Computation
Communication and Concurrency
JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Synchronous and Asynchronous Communication Paradigms
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Principal Typing Schemes in a Polyadic pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
IBM Systems Journal
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Semantic Subtyping for the p-Calculus
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Types and full abstraction for polyadic π-calculus
Information and Computation
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
Synchrony vs Asynchrony in Communication Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
On the relative expressive power of asynchronous communication primitives
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Pattern matching over a dynamic network of tuple spaces
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
XPi: a typed process calculus for XML messaging
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
PiDuce: a process calculus with native XML datatypes
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Welcome to the jungle: a subjective guide to mobile process calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
On the expressiveness of interaction
Theoretical Computer Science
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
Expressing global priorities by best-matching
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), arity (monadic vs polyadic data), communication medium (message passing vs shared dataspaces) and pattern-matching. Some of these primitives have already been used in at least one language which has appeared in the literature; however, to reason uniformly on such primitives, we plug them into a common framework based on the @p. By means of possibility/impossibility of 'reasonable' encodings, we compare every pair of primitives to obtain a hierarchy of languages based on their relative expressive power.