The Join-Calculus

The join-calculus is an experimental language based on the homonymous 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.

Our second implementation of the join-calculus: Jocaml : a modified version of Objective-Caml 1.07 with all join-calculus constructs.

This is our second release of the join-calculus language (1.02, bug-fix only). Check it out!

• The join-calculus documentation and user's manual, including an tutorial.
• Transfer the distribution.
• Frequently asked questions (FAQ about the join-calculus).

Related Papers

• 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-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 join-pattern matching: Compiling Join-Patterns, by Fabrice Le Fessant and Luc Maranget, submitted to HLCL'98.
  
  
• On testing equivalence: May and Must Testing in the Join-Calculus, by C. Laneve. Technical Report UBLCS 96-04, University of Bologna, March 1996.

Related Works

• Luca Padovani's Bologna implementation of the join-calculus.
  
  
• Peter Selinger's early implementation of the core join-calculus.