A calculus of higher order communicating systems
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, I
Information and Computation
A fully abstract denotational model for higher-order processes
Information and Computation
A theory of higher order communicating systems
Information and Computation
Confluence for process verification
Theoretical Computer Science
Bisimulation for higher-order process calculi
Information and Computation
Weak confluence and &tgr;-inertness
Theoretical Computer Science
A fully abstract denotational semantics for the calculus of higher-order communicating systems
Theoretical Computer Science
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Higher-Order Process and Their Models
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Towards a Lambda-Calculus for Concurrent and Communicating Systems
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
| Hi-index | 5.23 |
Regarding behaviour equivalence in higher-order process calculi, Sangiorgi (Inform. and Comput. 131 (1996) 141) and Thomsen (Inform. and Comput. 116 (1995) 38) introduced context and higher-order bisimulations, respectively. In this paper, uniqueness of solutions of equations with respect to strong context and higher-order bisimilarities and compatibility of strong context and higher-order bisimilarities with recursive definitions are shown. Copyright 2001 Elsevier Science B.V.