## The name discipline of uniform receptiveness (Extended Abstract) (1997)

Venue: | In Proceedings of ICALP'97 |

Citations: | 5 - 0 self |

### BibTeX

@INPROCEEDINGS{Sangiorgi97thename,

author = {Davide Sangiorgi},

title = {The name discipline of uniform receptiveness (Extended Abstract)},

booktitle = {In Proceedings of ICALP'97},

year = {1997},

pages = {303--313},

publisher = {Springer}

}

### OpenURL

### Abstract

this paper, we study the situation in which certain names are uniformly receptive. A name x is receptive in a process P if at any time P is able of offering an input at x (at least as long as there are processes that could send messages at x). The receptiveness of x is uniform if all inputs at x have the same continuation. Receptiveness ensures that any message sent at x can be immediately processed; unformity ensures that there is a unique way in which a message at x may be processed (that is, the input end of x is "functional").

### Citations

995 | D.: A calculus of mobile processes, i - Milner, Parrow, et al. - 1992 |

259 |
Expressing Mobility in Process Algebra: First-Order and Higher-Order Paradigms
- Sangiorgi
- 1993
(Show Context)
Citation Context ...e the proof of some transformations that introduce parallelism in a resource, and the proof of the correctness of an optimisation of the translation of higher-order process calculi into the -calculus =-=[18, 13]-=-, which is adopted in the compiler of Pict [12]. The challenge in these examples is that the equalities implied by the transformations fail in the ordinary -calculus (even w.r.t. the very coarse notio... |

251 | Pict: A Programming Language Based on the Pi-Calculus
- Pierce, Turner
- 2000
(Show Context)
Citation Context ...parallelism in a resource, and the proof of the correctness of an optimisation of the translation of higher-order process calculi into the -calculus [18, 13], which is adopted in the compiler of Pict =-=[12]-=-. The challenge in these examples is that the equalities implied by the transformations fail in the ordinary -calculus (even w.r.t. the very coarse notion of trace equivalence). That is, there are con... |

241 |
The Reflexive Chemical Abstract Machine and the Join Calculus
- Fournet, Gonthier
(Show Context)
Citation Context ... in particular those with input/output modalities and with linearity. They might also be useful in cases where either the receptiveness or the uniformity condition fails; for instance the calculus in =-=[2]-=-, where all names are uniform but not necessarily receptive, or that in [1], where all names are receptive but not necessarily uniform. Acknowledgements. The author would like to thank G. Boudol, N. K... |

241 | Typing and subtyping for mobile processes
- Pierce, Sangiorgi
- 1993
(Show Context)
Citation Context ...between the target processes of Milner 's two encodings of call-by-values -calculus into -calculus [8] (this is a novel result); the proofs of some stronger versions of -calculus replication theorems =-=[10]-=- (these results were already proved in [10]; exploiting receptiveness we get simpler proofs). 6 Final remarks Several type systems have been proposed for process calculi. The most relevant for this wo... |

136 | Linearity and the picalculus
- Kobayashi, Pierce, et al.
- 1999
(Show Context)
Citation Context ...or this work are [10], where the type system has input/output modalities to distinguish between the capabilities of reading and writing on names, and the type systems expressing linearity information =-=[3, 7, 4]-=-. The type system for receptiveness represents a refinement of [10] and, in the case of linear receptiveness, also of [7]. Also [10] and [7] contain studies of the effect of types on process behaviour... |

80 | π-calculus, internal mobility and agent-passing calculi, Theor
- Sangiorgi
- 1996
(Show Context)
Citation Context ...roperty that all receptive names which are emitted are private to the sender. Discreet processes are defined by means of syntactic restrictions on the output prefix similar to those in the language I =-=[15]-=-. Thirdly, we introduce a simple but powerful algebraic law, with which any well-typed process can be transformed into a discreet process. Remarkably, this law equates a process whose first action is ... |

76 | A partially deadlock-free type process calculus. Pages 128–139 of
- Kobayashi
- 1997
(Show Context)
Citation Context ...techniques developed in this paper are easier to apply, mainly because based on labeled bisimilarities. Other papers with results on behavioural consequences of -calculus types include the following. =-=[6]-=- defines a type system for the asynchronous -calculus that guarantees deadlock freedom in certain cases; a subsystem of this system is similar to ours for !-receptiveness. [19] uses a type system wher... |

59 | Graph types for monadic mobile processes
- Yoshida
- 1996
(Show Context)
Citation Context ...s include the following. [6] defines a type system for the asynchronous -calculus that guarantees deadlock freedom in certain cases; a subsystem of this system is similar to ours for !-receptiveness. =-=[19]-=- uses a type system where types have a graph structure to prove the full abstraction of an encoding of the polyadic -calculus into the monadic calculus. Graphs allow expressing sophisticated communica... |

54 | Behavioral Equivalence in the Polymorphic Pi-Calculus
- Pierce, Sangiorgi
(Show Context)
Citation Context ... complications in the typing. [14] uses a type system with input/output modalities and variant types to guarantee the adequacy of a translation of a typed object-oriented calculus into the -calculus. =-=[11]-=- studies the constraints imposed by parametric polymorphism. Some of the ideas in this paper should be useful to develop reasoning techniques for other type systems, in particular those with input/out... |

49 |
Types for dydadic interaction
- Honda
- 1993
(Show Context)
Citation Context ...or this work are [10], where the type system has input/output modalities to distinguish between the capabilities of reading and writing on names, and the type systems expressing linearity information =-=[3, 7, 4]-=-. The type system for receptiveness represents a refinement of [10] and, in the case of linear receptiveness, also of [7]. Also [10] and [7] contain studies of the effect of types on process behaviour... |

47 |
Plain CHOCS: A second generation calculus for higher order processes
- Thomsen
- 1993
(Show Context)
Citation Context ...e the proof of some transformations that introduce parallelism in a resource, and the proof of the correctness of an optimisation of the translation of higher-order process calculi into the -calculus =-=[18, 13]-=-, which is adopted in the compiler of Pict [12]. The challenge in these examples is that the equalities implied by the transformations fail in the ordinary -calculus (even w.r.t. the very coarse notio... |

28 | Composing processes
- Honda
- 1996
(Show Context)
Citation Context ...or this work are [10], where the type system has input/output modalities to distinguish between the capabilities of reading and writing on names, and the type systems expressing linearity information =-=[3, 7, 4]-=-. The type system for receptiveness represents a refinement of [10] and, in the case of linear receptiveness, also of [7]. Also [10] and [7] contain studies of the effect of types on process behaviour... |

23 |
An Interpretation of Typed Objects into Typed -Calculus
- Sangiorgi
- 1998
(Show Context)
Citation Context ... the full abstraction of an encoding of the polyadic -calculus into the monadic calculus. Graphs allow expressing sophisticated communication protocols but introduce some complications in the typing. =-=[14]-=- uses a type system with input/output modalities and variant types to guarantee the adequacy of a translation of a typed object-oriented calculus into the -calculus. [11] studies the constraints impos... |

17 |
Constraining interference in an object-based design method
- Jones
- 1993
(Show Context)
Citation Context ...The other equalities can be proved in a similar way. The above processes are simple. A more interesting example of parallelisation of resources is Cliff Jones's parallelisation transformation problem =-=[5]-=-. We analyse this in [16], where we prove Jones's transformation using a combination of the techniques for linear and ! receptiveness. Encoding of higher-order process calculi We now present an exampl... |

13 |
Functions as processes. Research Report 1154, INRIA, Sofia Antipolis
- Milner
- 1990
(Show Context)
Citation Context ...er [17], other examples of application of !-receptiveness are reported: The proof of the equivalence between the target processes of Milner 's two encodings of call-by-values -calculus into -calculus =-=[8]-=- (this is a novel result); the proofs of some stronger versions of -calculus replication theorems [10] (these results were already proved in [10]; exploiting receptiveness we get simpler proofs). 6 Fi... |

5 |
Typed -calculus at Work: A proof of Jones's parallelisation theorem on Concurrent Objects. Theory and Practice of Object-Oriented Systems
- Sangiorgi
- 1999
(Show Context)
Citation Context ... be proved in a similar way. The above processes are simple. A more interesting example of parallelisation of resources is Cliff Jones's parallelisation transformation problem [5]. We analyse this in =-=[16]-=-, where we prove Jones's transformation using a combination of the techniques for linear and ! receptiveness. Encoding of higher-order process calculi We now present an example with !-receptiveness. B... |

2 |
Locality and failures II. To appear as a Technical Report, INRIA-Sophia Antipolis
- Amadio
- 1997
(Show Context)
Citation Context ...might also be useful in cases where either the receptiveness or the uniformity condition fails; for instance the calculus in [2], where all names are uniform but not necessarily receptive, or that in =-=[1]-=-, where all names are receptive but not necessarily uniform. Acknowledgements. The author would like to thank G. Boudol, N. Kobayashi, C. Jones, B. Pierce, D. Walker, N. Yoshida and two of the anonymo... |

1 |
The name discipline of uniform receptiveness. (This is a slightly longer version of the present paper.) Available as ftp://zenon.inria.fr/meije/theorie-par/davides/RecePi.ps.Z
- Sangiorgi
(Show Context)
Citation Context ...es of labelled bisimilarities, including proof techniques such as "bisimulation up to expansion". For lack of space, some definitions and most of the proofs are omitted. More examples can be=-= found in [17]-=-. 2 Some background on the -calculus We use lower case letters p; q; r; : : : to range over names, and upper case letters P; Q; R to range over the set P of processes. This is the -calculus grammar (f... |