Graph Types For Monadic Mobile Processes (1996)
Cached
Download Links
- [www.mcs.le.ac.uk]
- [ftp.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.lfcs.inf.ed.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | University of Edinburgh |
| Citations: | 56 - 7 self |
BibTeX
@INPROCEEDINGS{Yoshida96graphtypes,
author = {Nobuko Yoshida},
title = {Graph Types For Monadic Mobile Processes},
booktitle = {University of Edinburgh},
year = {1996},
pages = {371--386},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. While types for name passing calculi have been studied extensively in the context of sorting of polyadic ß-calculus [5, 34, 9, 28, 32, 19, 33, 10, 17], the same type abstraction is not possible in the monadic setting, which was left as an open issue by Milner [21]. We solve this problem with an extension of sorting which captures dynamic aspects of process behaviour in a simple way. Equationally this results in the full abstraction of the standard encoding of polyadic ß-calculus into the monadic one: the sorted polyadic ß-terms are equated by a basic behavioural equality in the polyadic calculus if and only if their encodings are equated in a basic behavioural equality in the typed monadic calculus. This is the first result of this kind we know of in the context of the encoding of polyadic name passing, which is a typical example of translation of high-level communication structures into ß- calculus. The construction is general enough to be extendable to encodings of calculi with mo...
