Kouzapas, D., Pérez, J. A. and Yoshida, N. (2016) On the relative expressiveness of higher-order session processes. In: 25th European Symposium on Programming, ESOP 2016, Eindhoven, The Netherlandd, 02-08 Apr 2016, pp. 446-475. ISBN 9783662494974 (doi: 10.1007/978-3-662-49498-1_18)
|
Text
122252.pdf - Accepted Version 395kB |
Abstract
By integrating constructs from the λ-calculus and the π-calculus, in higher-order process calculi exchanged values may contain processes. This paper studies the relative expressiveness of HOπ, the higher-order π-calculus in which communications are governed by session types. Our main discovery is that HO, a subcalculus of HOπ which lacks name-passing and recursion, can serve as a new core calculus for session-typed higher-order concurrency. By exploring a new bisimulation for HO, we show that HO can encode HOπ fully abstractly (up to typed contextual equivalence) more precisely and efficiently than the first-order session π-calculus (π). Overall, under session types, HOπ, HO, and π are equally expressive; however, HOπ and HO are more tightly related than HOπ and π.
Item Type: | Conference Proceedings |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Kouzapas, Mr Dimitrios |
Authors: | Kouzapas, D., Pérez, J. A., and Yoshida, N. |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
College/School: | College of Science and Engineering > School of Computing Science |
ISSN: | 0302-9743 |
ISBN: | 9783662494974 |
Copyright Holders: | Copyright © 2016 Springer-Verlag Berlin Heidelberg |
First Published: | First published in Programming Languages and Systems : 446-475 |
Publisher Policy: | Reproduced in accordance with the publisher copyright policy |
University Staff: Request a correction | Enlighten Editors: Update this record