Compiling Join-Patterns (1998)
| Venue: | Electronic Notes in Computer Science |
| Citations: | 19 - 3 self |
BibTeX
@INPROCEEDINGS{Maranget98compilingjoin-patterns,
author = {Luc Maranget and Fabrice Le Fessant},
title = {Compiling Join-Patterns},
booktitle = {Electronic Notes in Computer Science},
year = {1998},
publisher = {Elsevier Science Publishers}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1 Introduction Join-pattern is the distinctive feature of the join-calculus, seen both as a process calculus and as a programming language. On the calculus side, join-calculus can roughly be seen as a functional calculus plus join-patterns, thus achieving the same expressive power as previous name-passing process calculi [11]. Joindefinitions are made of several clauses, each clause being a pair of a join-pattern and of a guarded process. A join-pattern expresses a synchronization between several names (or channels). When...
