The Join-Calculus
The join-calculus first is a process calculus. It provides a simple support for distributed programming.
The join-calculus programming model features concurrent processes running on several machines, static type-checking, global lexical scope, transparent remote communication, agent-based mobility, and some failure-detection.
Implementations
We have developped three implementations of the Join-Calculus in the Objective-CAML environment.
- The new JoCaml is an extension of Objective-Caml. This implementation is the only that is actively maintained.
- Archives: the following two implementation are obsolete.
- The join calculus language is our first join-language ever. It is an autonomous language.
- The previous JoCaml system, now unmaintained, compatible with OCaml 1.07.
Related Papers on the WEB
- On mixing algebraic pattern matching and join matching. Compiling Pattern Matching in Join-Patterns, by Ma Qin and Luc Maranget, CONCUR'04.
- Our model of concurrency: The reflexive chemical abstract machine and the join-calculus, by Cédric Fournet and Georges Gonthier, POPL'96.
- On distributed programming: A calculus of mobile agents, by Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget and Didier Rémy, CONCUR'96.
- On join-pattern compilation: Compiling Join-Patterns, by Fabrice Le Fessant and Luc Maranget, HLCL'98.
- On join-calculus typing: Implicit Typing à la ML for the join-calculus, by Cédric Fournet, Cosimo Laneve, Luc Maranget and Didier Rémy, CONCUR'97.
- On testing equivalence: May and Must Testing in the Join-Calculus, by C. Laneve. Technical Report UBLCS 96-04, University of Bologna, March 1996.
Style:
Default -
Fallen Leaf -
Simple Blue -
Simple Purple -
Clear
Last modified: 2007/06/04 -
The Moscova project