Join-calculus

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 $\pi$ . Encodings of the $\pi$ -calculus in the join-calculus, and vice versa, have been demonstrated.

The join-calculus is a member of the $\pi$ family of process calculi, and can be considered, at its core, an asynchronous $\pi$ -calculus with several strong restrictions:

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 $\pi$ -calculus — namely the use of multi-way join patterns, the ability to match against messages from multiple channels simultaneously.

This page contains text from Wikipedia, the Free Encyclopedia - https://wn.com/Join-calculus

Join-calculus (programming language)

In computer science, the join-calculus is a programming language based on the identically-named 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 join calculus has been integrated into several languages

Polyphonic C#

Join Java

C++ via Boost

JErlang (the J is for Join, erjang is Erlang for the JVM)