Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
The International Joint Conference on theory and practice of software development on TAPSOFT '87
SMoLCS-driven concurrent calculi
The International Joint Conference on theory and practice of software development on TAPSOFT '87
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Syntax and informal semantics of DyNe, a parallel language
The Analysis of Concurrent Systems
Combinators and bisimulation proofs for restartable systems
Combinators and bisimulation proofs for restartable systems
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order concurrent programs with finite communication topology (extended abstract)
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An operational framework for value-passing processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (preliminary report)
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiler correctness for parallel languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Programming languages, analysis tools, and concurrency theory
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Recursive equations in higher-order process calculi
Theoretical Computer Science
Mobile calculi for distributed programming
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Seal: A Framework for Secure Mobile Computations
ICCL'98 Workshop on Internet Programming Languages
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
HOPLA-A Higher-Order Process Language
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Bisimulation congruence of ℵ-calculus
Information and Computation
Theoretical Computer Science
Theoretical Computer Science - Logic, semantics and theory of programming
Expressing first-order π-calculus in higher-order calculus of communicating systems
Journal of Computer Science and Technology
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Theories of Programming and Formal Methods
Hi-index | 0.00 |
In this paper we present A Calculus of Higher Order Communicating Systems. This calculus considers sending and receiving processes to be as fundamental as nondeterminism and parallel composition.The calculus is an extension of CCS [Mil80] in the sense that all the constructions of CCS are included or may be derived from more fundamental constructs and most of the mathematical framework of CCS carries over almost unchanged.Clearly CCS with processes as first class objects is a powerful metalanguage and we show that it is possible to simulate the untyped &lgr;-calculus in CHOCS. The relationship between CHOCS and the untyped &lgr;-calculus is further strengthened by a result showing that the recursion operator is unnecessary in the sense that recursion can be simulated by means of process passing and communication.As pointed out by R. Milner in [Mil80], CCS has its limitations when one wants to describe unboundedly expanding systems as e.g. an unbounded number of procedure invocations in an imperative concurrent programming language. We show how neatly CHOCS may describe both call by value and call by reference parameter mechanisms for the toy language of chapter 6 in [Mil80].