Compiling Join-Patterns1

Luc Maranget   Fabrice Le Fessant

INRIA Rocquencourt, BP 105, 78153 Le Chesnay Cedex France.
{Luc.Maranget, Fabrice.Le-Fessant}

This article in (compressed) Postscript.
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.

This document was translated from LATEX by HEVEA.