Compiling Join-Patterns1 1This work is partly supported by the ESPRIT CONFER-2 WG-21836
Fabrice Le Fessant, Luc Maranget · Electronic Notes in Theoretical Computer Science · 1998
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.