The reflexive CHAM and the join-calculus Export

@inproceedings{citeulike:5937703, abstract = {By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurrency that is consistent with mobility and distribution. Our model provides the foundations of a programming language with functional and object-oriented features. It can also be seen as a process calculus, the join-calculus, which we prove equivalent to the {\ss}-calculus of Milner, Parrow and Walker. 1 Introduction There is a mismatch between calculi for concurrent processes and languages for programming distributed and mobile systems. Calculi such as CCS or the {\ss}- calculus [16, 19] introduce a small number of constructs, and have a thoroughly studied metatheory. However, they are mostly based on atomic non-local interaction (typically rendez-vous), which is difficult to implement fully in a distributed setting. Programming languages such as Actors [1] or Obliq [8] have separate primitives for transmission and synchronization, for instance remote procedure call and semaphores. However, th...}, author = {Fournet, Cedric and Gonthier, Georges and Rocquencourt, Inria}, booktitle = {In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages}, citeulike-article-id = {5937703}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.5804}, keywords = {chemical-abstract-machine, join-calculus, pi-calculus, process-calculi}, pages = {372--385}, posted-at = {2009-10-13 20:20:00}, priority = {2}, title = {The reflexive CHAM and the join-calculus}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.5804}, year = {1995} }

TY - CONF ID - citeulike:5937703 L3 - citeulike-article-id:5937703 N2 - By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurrency that is consistent with mobility and distribution. Our model provides the foundations of a programming language with functional and object-oriented features. It can also be seen as a process calculus, the join-calculus, which we prove equivalent to the ß-calculus of Milner, Parrow and Walker. 1 Introduction There is a mismatch between calculi for concurrent processes and languages for programming distributed and mobile systems. Calculi such as CCS or the ß- calculus [16, 19] introduce a small number of constructs, and have a thoroughly studied metatheory. However, they are mostly based on atomic non-local interaction (typically rendez-vous), which is difficult to implement fully in a distributed setting. Programming languages such as Actors [1] or Obliq [8] have separate primitives for transmission and synchronization, for instance remote procedure call and semaphores. However, th... EP - 385 TI - The reflexive CHAM and the join-calculus T2 - In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages SP - 372 KW - chemical-abstract-machine KW - join-calculus KW - pi-calculus KW - process-calculi AU - Fournet, Cedric AU - Gonthier, Georges AU - Rocquencourt, Inria PY - 1995/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.5804 ER -