eprintid: 3346
rev_number: 9
eprint_status: archive
userid: 67
dir: disk0/00/00/33/46
datestamp: 2016-04-19 07:48:41
lastmod: 2016-04-19 09:06:15
status_changed: 2016-04-19 07:48:41
type: article
metadata_visibility: show
creators_name: Lanese, Ivan
creators_name: Mezzina, Claudio Antares
creators_name: Stefani, Jean-Bernard
creators_id: 
creators_id: claudio.mezzina@imtlucca.it
creators_id: 
title: Reversibility in the higher-order \(π\)-calculus
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: public
keywords: Reversible computation; Process algebra; π-Calculus
abstract: The notion of reversible computation is attracting increasing interest because of its applications in diverse fields, in particular the study of programming abstractions for reliable systems. In this paper, we continue the study undertaken by Danos and Krivine on reversible CCS by defining a reversible higher-order π  -calculus, called rhoπ. We prove that reversibility in our calculus is causally consistent and that the causal information used to support reversibility in rhoπ is consistent with the one used in the causal semantics of the π  -calculus developed by Boreale and Sangiorgi. Finally, we show that one can faithfully encode rhoπ into a variant of higher-order π, substantially improving on the result we obtained in the conference version of this paper.
date: 2016
date_type: published
publication: Theoretical Computer Science
volume: 625
publisher: Elsevier
pagerange: 25-84
refereed: TRUE
issn: 0304-3975
official_url: http://dx.doi.org/10.1016/j.tcs.2016.02.019
citation:   Lanese, Ivan and Mezzina, Claudio Antares and Stefani, Jean-Bernard  Reversibility in the higher-order \(π\)-calculus.  Theoretical Computer Science, 625.  pp. 25-84.  ISSN 0304-3975      (2016)  
document_url: http://eprints.imtlucca.it/3346/1/tcs_rhopi.pdf