&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
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation
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
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Separation of synchronous and asynchronous communication via testing
Theoretical Computer Science
On the Expressiveness and Decidability of Higher-Order Process Calculi
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Concurrent and Located Synchronizations in π-Calculus
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Types and full abstraction for polyadic π-calculus
Information and Computation
On the expressiveness and decidability of higher-order process calculi
Information and Computation
| Hi-index | 0.00 |
Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-understood for first-order calculi but not in the higher-order setting: synchronous vs. asynchronous communication and polyadic vs. monadic communication. First, and similarly to the first-order setting, synchronous process-passing is shown to be encodable into asynchronous processpassing. Then, the absence of name-passing is shown to induce a hierarchy of higher-order process calculi based on the arity of polyadic communication, thus revealing a striking point of contrast with respect to first-order calculi. Finally, the passing of abstractions (i.e., functions from processes to processes) is shown to be more expressive than process-passing alone.