Abstract:

The join-calculus is both a name passing calculus and a core language for concurrent and distributed programming. An essential part of its implementation is the compilation of join-patterns. Join-patterns define new channels and all the synchronizations they take part to at the same time. Relying on the experience based on our two implementations, we study the translation of join-patterns into deterministic finite-state automata as well as some related optimizations.

• Contents
• Introduction
• A rapid tour of the join-calculus
  • Syntax
  • Semantics
  • The join programming languages
• Pattern matching in join definitions
  • Principle
  • Towards deterministic automata
  • Automata and semantics
• Runtime definitions
  • Basics
  • Definitions in join
  • Definitions in jocaml
• The pragmatics of compilation
  • Refined status
  • Taking advantage of semantical analysis
  • Avoiding status space explosion
• Optimizing further
• Conclusion and future work
• References

This document was translated from L^AT_EX by H^EV^EA.