The join-calculus is a process calculus developed at INRIA. The join-calculus was developed to provide a formal basis for the design of distributed programming languages, and therefore intentionally avoids communications constructs found in other process calculi, such as rendezvous communications, which are difficult to implement in a distributed setting. Despite this limitation, the join-calculus is as expressive as the full -calculus. Encodings of the -calculus in the join-calculus, and vice-versa, have been demonstrated.
- Scope restriction, reception, and replicated reception are syntactically merged into a single construct, the definition;
- Communication occurs only on defined names;
- For every defined name there is exactly one replicated reception.
However, as a language for programming, the join-calculus offers at least one convenience over the -calculus — namely the use of multi-way join patterns, the ability to match against messages from multiple channels simultaneously.
Languages based on the join-calculus
The join-calculus programming language is based on the join-calculus process calculus. It is implemented as an interpreter written in OCaml, and supports statically typed distributed programming, transparent remote communication, agent-based mobility, and failure-detection.
The Boost.Join library is an implementation in C++.
A Concurrent Basic proposal that uses Join-calculus
- Cedric Fournet, Georges Gonthier (1995). The reflexive CHAM and the join-calculus., pg. 1
- Cedric Fournet, Georges Gonthier (1995). The reflexive CHAM and the join-calculus., pg. 2
- Cedric Fournet, Georges Gonthier (1995). The reflexive CHAM and the join-calculus., pg. 19
- Cedric Fournet, Georges Gonthier (2000). The Join Calculus: A Language for Distributed Mobile Programming.
- INRIA, Join Calculus homepage
|This programming language–related article is a stub. You can help Wikipedia by expanding it.|