BdL17-STOI (In proceedings)
|
Author(s) | Franco Barbanera and Ugo de' Liguoro |
Title | « Session Types for Orchestrated Interactions » |
In | Proceedings 10th Interaction and Concurrency Experience, Neuchâtel, Switzerland, 21-22nd June 2017 |
Series | Electronic Proceedings in Theoretical Computer Science |
Editor(s) | Massimo Bartoletti, Laura Bocchi, Ludovic Henrio and Sophia Knight |
Volume | 261 |
Page(s) | 17-36 |
Year | 2017 |
Publisher | Open Publishing Association |
URL | http://arxiv.org/abs/1711.11209 |
Abstract |
In the setting of the -calculus with binary sessions, we aim at relaxing the notion of duality of session types by the concept of retractable compliance developed in contract theory. This leads to extending session types with a new type operator of "speculative selection" including choices not necessarily offered by a compliant partner. We address the problem of selecting successful communicating branches by means of an operational semantics based on orchestrators, which has been shown to be equivalent to the retractable semantics of contracts, but clearly more feasible. A type system, sound with respect to such a semantics, is hence provided. |
@inproceedings{BdL17-STOI,
volume = {261},
author = {Franco Barbanera and Ugo de' Liguoro},
series = {Electronic Proceedings in Theoretical Computer Science},
booktitle = {{\rm Proceedings 10th} Interaction and Concurrency Experience,
{\rm Neuch\^atel, Switzerland, 21-22nd June 2017}},
timestamp = {Mon, 04 Dec 2017 18:34:59 +0100},
editor = {Bartoletti, Massimo and Bocchi, Laura and Henrio, Ludovic and
Knight, Sophia},
url = {http://arxiv.org/abs/1711.11209},
tag = {{ICE 2017}},
title = {{Session Types for Orchestrated Interactions}},
abstract = {In the setting of the $\pi$-calculus with binary sessions, we aim
at relaxing the notion of duality of session types by the concept
of retractable compliance developed in contract theory. This leads
to extending session types with a new type operator of
"speculative selection" including choices not necessarily offered
by a compliant partner. We address the problem of selecting
successful communicating branches by means of an operational
semantics based on orchestrators, which has been shown to be
equivalent to the retractable semantics of contracts, but clearly
more feasible. A type system, sound with respect to such a
semantics, is hence provided.},
publisher = {Open Publishing Association},
doi = {10.4204/EPTCS.261.5},
pages = {17-36},
year = {2017},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)