Solo Diagrams

We address the problems of implementing the replication operator efficiently in the solos calculus - a calculus of mobile processes without prefix. This calculus is expressive enough to admit an encoding of the whole fusion calculus and thus the ?-calculus. We show that nested occurrences of replication can be avoided, that the size of replicated terms can be limited to three particles, and that the usual unfolding semantics of replication can be replaced by three simple reduction rules. To illustrate the results and show how the calculus can be efficiently implemented we present a graphic representation of agents in the solos calculus, adapting ideas from interaction diagrams and pi-nets.

[1]  Benjamin C. Pierce,et al.  Pict: a programming language based on the Pi-Calculus , 2000, Proof, Language, and Interaction.

[2]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[3]  D. Walker,et al.  A Calculus of Mobile Processes, Part I , 1989 .

[4]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

[5]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[6]  Yves Lafont,et al.  Interaction nets , 1989, POPL '90.

[7]  Joachim Parrow.  Interaction Diagrams , 1995, Nord. J. Comput..

[8]  M. Nivat.  Theoretical Computer Science Volume 213-214 , 1999 .

[9]  Gianluigi Bellin,et al.  On the pi-Calculus and Linear Logic , 1992, Theor. Comput. Sci..

[10]  Joachim Parrow,et al.  Trios in concert , 2000, Proof, Language, and Interaction.

[11]  G. Erard Boudol.  Asynchrony and the -calculus (note) , 1992 .

[12]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[13]  Robin Milner.  Pi-Nets: A Graphical Form of pi-Calculus , 1994, ESOP.

[14]  D. Walker.  A Calculus of Mobile Processes, Part Ii , 1989 .

[15]  Nobuko Yoshida.  Graph Notation for Concurrent Combinators , 1994, Theory and Practice of Parallel Programming.

[16]  Cosimo Laneve,et al.  Solos in Concert , 1999, ICALP.

[17]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[18]  Martín Abadi,et al.  The geometry of optimal lambda reduction , 1992, POPL '92.

[19]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[20]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[21]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[22]  Yuxi Fu.  A Proof Theoretical Approach to Communication , 1997, ICALP.

[23]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[24]  Robin Milner.  Functions as Processes , 1990, ICALP.