## On Asynchrony in Name-Passing Calculi (1998)

### Cached

### Download Links

- [www.inria.fr]
- [www.cs.unibo.it]
- [lamp.epfl.ch]
- DBLP

### Other Repositories/Bibliography

Venue: | In |

Citations: | 86 - 13 self |

### BibTeX

@INPROCEEDINGS{Merro98onasynchrony,

author = {Massimo Merro and Davide Sangiorgi},

title = {On Asynchrony in Name-Passing Calculi},

booktitle = {In},

year = {1998},

pages = {856--867},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

The asynchronous pi-calculus is considered the basis of experimental programming languages (or proposal of programming languages) like Pict, Join, and Blue calculus. However, at a closer inspection, these languages are based on an even simpler calculus, called Local (L), where: (a) only the output capability of names may be transmitted; (b) there is no matching or similar constructs for testing equality between names. We study the basic operational and algebraic theory of Lpi. We focus on bisimulation-based behavioural equivalences, precisely on barbed congruence. We prove two coinductive characterisations of barbed congruence in Lpi, and some basic algebraic laws. We then show applications of this theory, including: the derivability of delayed input; the correctness of an optimisation of the encoding of call-by-name lambda-calculus; the validity of some laws for Join.