## The Name Discipline of Uniform Receptiveness (1997)

Venue: | Theoretical Computer Science |

Citations: | 63 - 4 self |

### BibTeX

@INPROCEEDINGS{Sangiorgi97thename,

author = {Davide Sangiorgi},

title = {The Name Discipline of Uniform Receptiveness},

booktitle = {Theoretical Computer Science},

year = {1997},

pages = {303--313},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

In a process calculus, we say that a name x is uniformly receptive for a process P if: (1) at any time P is ready to accept an input at x, at least as long as there are processes that could send messages at x; (2) the input offer at x is functional, that is, all messages received by P at x are applied to the same continuation. In the -calculus this discipline is employed, for instance, when modeling functions, objects, higher-order communications, remote-procedure calls. We formulate the discipline of uniform receptiveness by means of a type system, and then we study its impact on behavioural equivalences and process reasoning. We develop some theory and proof techniques for uniform receptiveness, and illustrate their usefulness on some non-trivial examples.

### Citations

1064 | Bigraphs and mobile processes - Jensen, Milner - 2003 |

282 |
The Polyadic -calculus: a Tutorial
- Milner
- 1993
(Show Context)
Citation Context ...oof of the equivalence between the target processes of Milner's two encodings of call-by-values -calculus into -calculus [Mil90]; the proof of some stronger versions of -calculus replication theorems =-=[Mil91]-=-, and the proof of some -insensitiveness, or partial conAEuence, results. The challenge in these examples is that the equalities implied by the transformations fail in the ordinary -calculus (even w.r... |

272 |
Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms
- Sangiorgi
- 1992
(Show Context)
Citation Context ...the proof of some transformationssthat introduce parallelism in a resource, and the proof of the correctness of ansoptimisation of the translation of higher-order process calculi into the 7r-calculuss=-=[18, 13]-=-, which is adopted in the compiler of Pict [12].sThe challenge in these examples is that the equalities implied by the trans-sformations fail in the ordinary ~r-calculus (even w.r.t, the very coarse n... |

263 | Piet: A programming language based on the pi- calculus
- Pierce, Turner
- 1997
(Show Context)
Citation Context ...rallelism in a resource, and the proof of the correctness of ansoptimisation of the translation of higher-order process calculi into the 7r-calculuss[18, 13], which is adopted in the compiler of Pict =-=[12]-=-.sThe challenge in these examples is that the equalities implied by the trans-sformations fail in the ordinary ~r-calculus (even w.r.t, the very coarse notion ofstrace equivalence). That is, there are... |

253 |
The Reflexive Chemical Abstract Machine and the Join calculus
- Fournet, Gonthier
- 1996
(Show Context)
Citation Context ... in operating systems and object-oriented languages. The function call (3) itself is an example of an RPC interaction. Languages and calculi based on the -calculus, such as PICT [PT97], Join Calculus =-=[CG96]-=- and Blue Calculus [Bou97], have syntactic constructs like def z(a) = P in Q that, translated into -calculus, are written z (!z(a). P j Q); therefore the introduced name z is !-receptive. As behaviour... |

251 | Typing and subtyping for mobile processes
- Pierce, Sangiorgi
- 1996
(Show Context)
Citation Context ...en the target processes of Mil-sner's two encodings of call-by-values A-calculus into 7r-calculus [8] (this is a novelsresult); the proofs of some stronger versions of v-calculus replication theoremss=-=[10]-=- (these results were already proved in [10]; exploiting receptiveness we getssimpler proofs).s6 F ina lsremarkssSeveral type systems have been proposed for process calculi. The most relevantsfor this ... |

144 | Linearity and the Pi-Calculus
- Kobayashi, Pierce, et al.
- 1999
(Show Context)
Citation Context ...names, and the type systems expressing linearity information [Hon93, KPT96, Hon96]. The type system for receptiveness represents a renement of [PS96] and, in the case of linear receptiveness, also of =-=[KPT96]-=-. Also [PS96] and [KPT96] contain studies of the eoeect of types on process behaviours, using barbed congruence. The proof techniques developed in this paper are easier to apply, mainly because based ... |

119 | An asynchronous model of locality, failure, and process mobility
- Amadio
- 1997
(Show Context)
Citation Context ...ht also be useful in cases where either the receptiveness or the uniformity condition fails; for instance the calculus in [CG96], where all names are uniform but not necessarily receptive, or that in =-=[Ama97a]-=-, where all names are receptive but not necessarily uniform. Acknowledgements. The author would like to thank G#rard Boudol, Naoki Kobayashi, Clioe Jones, Benjamin Pierce, David Walker, Nabuko Yoshida... |

93 | Types for dyadic interaction - Honda - 1993 |

87 | 7r-calculus, internal mobility and agent-passing calculi
- Sangiorgi
- 1996
(Show Context)
Citation Context ...perty that all receptivesnames which are emitted are private to the sender. Discreet processes are definedsby means of syntactic restrictions on the output prefix similar to those in theslanguage ~rI =-=[15]-=-. Thirdly, we introduce a simple but powerful algebraic law,swith which any well-typed process can be transformed into a discreet process.sRemarkably, this law- equates a process whose first action is... |

78 | A partially deadlock-free typed process calculus. To appear as a technical report
- Kobayashi
- 1997
(Show Context)
Citation Context ...are easier to apply, mainly because based on labeled bisimilarities. 22 Other works that have results on behavioural consequences of types for messagepassing processes include the following. Kobayahi =-=[Kob97]-=- denes a type system for the asynchronous -calculus that guarantees deadlock freedom in certain cases; a subsystem of his is similar to ours for !-receptiveness. Yoshida [Yos96] uses a type system whe... |

61 | Graph types for monadic mobile processes
- Yoshida
- 1996
(Show Context)
Citation Context ...include the following. [6] defines a type system for the asynchronous 7r-calculussthat guarantees deadlock freedom in certain cases; a subsystem of this systemsis similar to ours for w-receptiveness. =-=[19]-=- uses a type system where types havesa graph structure to prove the full abstraction of an encoding of the polyadicsw-calculus into the monadic alculus. Graphs allow expressing sophisticated com-smuni... |

58 | Behavioral equivalence in the polymorphic pi-calculus
- Pierce, Sangiorgi
- 1997
(Show Context)
Citation Context ... complications in the typing. [14] usessa type system with input/output modalities and variant ypes to guarantee thesadequacy of a translation of a typed object-oriented calculus into the w-calculus.s=-=[11]-=- studies the constraints imposed by parametric polymorphism.sSome of the ideas in this paper should be useful to develop reasoning tech-sniques for other type systems, in particular those with input/o... |

51 |
Plain CHOCS, a second generation calculus for higher-order pro- cesses
- Thomsen
- 1993
(Show Context)
Citation Context ...the proof of some transformationssthat introduce parallelism in a resource, and the proof of the correctness of ansoptimisation of the translation of higher-order process calculi into the 7r-calculuss=-=[18, 13]-=-, which is adopted in the compiler of Pict [12].sThe challenge in these examples is that the equalities implied by the trans-sformations fail in the ordinary ~r-calculus (even w.r.t, the very coarse n... |

50 |
Types for dydadic interaction
- Honda
- 1993
(Show Context)
Citation Context ... this work are [10], where the type system has input/output modalities to dis-stinguish between the capabilities of reading and writing on names, and the typessystems expressing linearity information =-=[3, 7, 4]-=-. The type system for recep-stiveness represents a refinement of [10] and, in the case of linear receptiveness,salso of [7]. Also [10] and [7] contain studies of the effect of types on processsbehavio... |

31 | Call-by-name, call-by-value, callby-need, and the linear lambda calculus - Maraist, Odersky, et al. - 1995 |

29 | Composing processes
- Honda
- 1996
(Show Context)
Citation Context ... lead to a drastic increase of the number of rules. This problem can be solved by introducing appropriate notations for manipulating types and type environments, as done, for instance, in [KPT96] and =-=[Hon96]-=-. Milner's encodings of call-by-name and call-by-value -calculus [Mil91] can be presented in such a way that all names used are either linear or !-receptive. On the simply-typed -calculus, these encod... |

27 | The geometry of implementation - Mackie - 1994 |

26 |
Typing the use of resources in a concurrent calculus
- Boudol
(Show Context)
Citation Context ... object-oriented languages. The function call (3) itself is an example of an RPC interaction. Languages and calculi based on the -calculus, such as PICT [PT97], Join Calculus [CG96] and Blue Calculus =-=[Bou97]-=-, have syntactic constructs like def z(a) = P in Q that, translated into -calculus, are written z (!z(a). P j Q); therefore the introduced name z is !-receptive. As behavioural equivalence on processe... |

17 |
Constraining interference in an object-based design method
- Jones
- 1993
(Show Context)
Citation Context ...on. The other equalities can be proved in a similar way. The above processes are simple. A more complex example of parallelisation of resources is Clioe Jones's parallelisation transformation problem =-=[Jon93]-=-. We analyse this in [San97], 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 3 exam... |

14 |
Functions as processes. Research Report 1154, INRIA, Sophia An- tipolis. Final version
- Milner
(Show Context)
Citation Context ...alculus [Tho93, San92], which is adopted in the compiler of Pict [PT97]; the proof of the equivalence between the target processes of Milner's two encodings of call-by-values -calculus into -calculus =-=[Mil90]-=-; the proof of some stronger versions of -calculus replication theorems [Mil91], and the proof of some -insensitiveness, or partial conAEuence, results. The challenge in these examples is that the equ... |

2 |
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 labelledsbisimilarities, including proof techniques such as "bisimulation up to expansion".sFor lack of space, some definitions and most of the proofs are omitted. Moresexamples can be found in =-=[17]-=-.s2 Some background onsthesre -ca lcu lussWe use lower case letters p, q, r , . . .sto range over names, and upper case letterssP, Q, R to range over the set T' of processes. This is the ~r-calculus g... |

1 |
Locality and failures IL To appear as a
- Amadio
- 1997
(Show Context)
Citation Context ...ght also be useful in cases where either the receptive-sness or the uniformity condition fails; for instance the calculus in [2], where allsnames are uniform but not necessarily receptive, or that in =-=[1]-=-, where all namessare receptive but not necessarily uniform.s313sAcknowledgements. The author would like to thank G. Boudot, N. Kobayashi, C.sJones, B. Pierce, D. Walker, N. Yoshida and two of the ano... |

1 |
Linearity and the pi-caleulus
- Kobayashi, Pierce, et al.
- 1996
(Show Context)
Citation Context ... this work are [10], where the type system has input/output modalities to dis-stinguish between the capabilities of reading and writing on names, and the typessystems expressing linearity information =-=[3, 7, 4]-=-. The type system for recep-stiveness represents a refinement of [10] and, in the case of linear receptiveness,salso of [7]. Also [10] and [7] contain studies of the effect of types on processsbehavio... |

1 |
An interpretation of typed objects into typed ~r-cMeulus
- Sangiorgi
- 1996
(Show Context)
Citation Context ...he full abstraction of an encoding of the polyadicsw-calculus into the monadic alculus. Graphs allow expressing sophisticated com-smunication protocols but introduce some complications in the typing. =-=[14]-=- usessa type system with input/output modalities and variant ypes to guarantee thesadequacy of a translation of a typed object-oriented calculus into the w-calculus.s[11] studies the constraints impos... |

1 |
Typed n-calculus at work: a proof of Jones's parallelisa- tion transformation on concurrent objects. Presented at Fourth Work- shop on Foundations of Object-Oriented Languages
- Sangiorgi
- 1997
(Show Context)
Citation Context ...n be proved in a similar way.sThe above processes are simple. A more interesting example of parallelisationsof resources i Cliff Jones's parallelisation transformation problem [5]. We analysesthis in =-=[16]-=-, where we prove Jones's transformation using a combination of thestechniques for linear and c~, receptiveness.sEncod ingsofsh igher -ordersprocessscalculisWe now present an example withsw-receptivene... |