DMCA
On Asynchrony in Name-Passing Calculi (2002)
Cached
Download Links
- [www.inria.fr]
- [www.cs.unibo.it]
- [lamp.epfl.ch]
- DBLP
Other Repositories/Bibliography
by
Massimo Merro
,
Davide Sangiorgi
| Venue: | In |
| Citations: | 97 - 15 self |
BibTeX
@INPROCEEDINGS{Merro02onasynchrony,
author = {Massimo Merro and Davide Sangiorgi},
title = {On Asynchrony in Name-Passing Calculi},
booktitle = {In},
year = {2002},
pages = {856--867},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The asynchronous #-calculus is considered the basis of experimental programming languages (or proposal of programming languages) like Pict, Join, and TyCO. However, at a closer inspection, these languages are based on an even simpler calculus, called Localised # (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.
