Abstract
It is shown that generally higher order process calculi cannot be interpreted in name-passing calculi in a robust way.
BibTeX - Entry
@InProceedings{fu:LIPIcs:2017:7778,
author = {Yuxi Fu},
title = {{On the Power of Name-Passing Communication}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {22:1--22:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Roland Meyer and Uwe Nestmann},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7778},
URN = {urn:nbn:de:0030-drops-77786},
doi = {10.4230/LIPIcs.CONCUR.2017.22},
annote = {Keywords: Interaction theory, expressiveness, bisimulation}
}
Keywords: |
|
Interaction theory, expressiveness, bisimulation |
Collection: |
|
28th International Conference on Concurrency Theory (CONCUR 2017) |
Issue Date: |
|
2017 |
Date of publication: |
|
01.09.2017 |