The expressive power of parallelism
Future Generation Computer Systems - Parallel computing
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
A small calculus for concurrent objects
OOPSLA/ECOOP '90 Proceedings of the workshop on Object-based concurrent programming
A calculus of mobile processes, I
Information and Computation
Combinatory representation of mobile processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Pi-calculus, dialogue games and full abstraction PCF
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
The analysis of programming structure
ACM SIGACT News
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Combinatory formulations of concurrent languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Game-theoretic analysis of call-by-value computation
Theoretical Computer Science
Replication in Concurrent Combinators
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Notes on P-Algebra 1: Process Structure
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Graph Notation for Concurrent Combinators
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ECOOP '94 Proceedings of the 8th European Conference on Object-Oriented Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Asynchrony in Name-Passing Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Bisimulations for the Asynchronous pi-Calculus
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On the Expressiveness of Internal Mobility in Name-Passing Calculi
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Interaction Nets and Term Rewriting Systems (Extended Abstract)
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Some Chemical Abstract Machines
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Causality for Mobile Processes
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Welcome to the jungle: a subjective guide to mobile process calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Hi-index | 5.23 |
In Honda and Yoshida (TACS'94, Lecture Notes in Computer Science, vol. 789, Springer, Berlin, 1994, pp. 786-805; POPL'94, ACM Press, New York, 1994, pp. 348-360) we presented a theory of concurrent combinators for the asynchronous monadic calculus without match or summation operator. The system of concurrent combinators is based on a finite number of atoms and fixed interaction rules, but is as expressive as the original calculus, so that it can represent diverse interaction structures, including polyadic synchronous name passing and input guarded summations. The present paper shows that each of the five basic combinators introduced in Honda and Yoshida (POPL'94, ACM Press, New York, 1994, pp. 348-360) is indispensable to represent the whole computation, i.e. if one of the combinators is missing, we can no longer express the original calculus up to semantic equalities. Expressive power of several interesting subsystems of the asynchronous calculus is also measured by using appropriate subsets of the combinators and their variants. Finally, as an application of the main result, we show there is no semantically sound encoding of the calculus into its proper subsystem under a certain condition.