dc.contributor.author |
Bernardi, Giovanni |
|
dc.contributor.author |
Hennessy, Matthew |
|
dc.date.accessioned |
2017-01-03T14:11:15Z |
|
dc.date.available |
2017-01-03T14:11:15Z |
|
dc.date.issued |
2014 |
|
dc.identifier.uri |
http://hdl.handle.net/10344/5419 |
|
dc.description |
peer-reviewed |
en_US |
dc.description.abstract |
Session types are used to describe and structure interactions between
independent processes in distributed systems. Higher-order types are needed in
order to properly structure delegation of responsibility between processes. In this
paper we show that higher-order web-service contracts can be used to provide
a fully-abstract model of recursive higher-order session types. The model is settheoretic,
in the sense that the denotation of a contract is given by the set of
contracts with which it complies; we use a novel notion of peer compliance. A
crucial step in the proof of full-abstraction is showing that every contract has a
non-empty denotation. |
en_US |
dc.language.iso |
eng |
en_US |
dc.publisher |
Springer |
en_US |
dc.relation.ispartofseries |
Baldan P., Gorla D. (eds) CONCUR 2014 – Concurrency Theory. CONCUR 2014. Lecture Notes in Computer Science;8704, pp. 387-401 |
|
dc.relation.uri |
http://dx.doi.org/10.1007/978-3-662-44584-6_27 |
|
dc.rights |
The original publication is available at www.springerlink.com |
en_US |
dc.subject |
computer software |
en_US |
dc.subject |
distributed systems |
en_US |
dc.title |
Using higher-order contracts to model session types. (Extended Abstract) |
en_US |
dc.type |
info:eu-repo/semantics/conferenceObject |
en_US |
dc.type.supercollection |
all_ul_research |
en_US |
dc.type.supercollection |
ul_published_reviewed |
en_US |
dc.identifier.doi |
10.1007/978-3-662-44584-6_27 |
|
dc.contributor.sponsor |
SFI |
en_US |
dc.relation.projectid |
06 IN.1 1898 |
en_US |
dc.relation.projectid |
PTDC/EIACCO /122547/2010 |
en_US |
dc.rights.accessrights |
info:eu-repo/semantics/openAccess |
en_US |