TY  - JOUR
AV  - public
ID  - eprints3346
TI  - Reversibility in the higher-order \(?\)-calculus
UR  - http://dx.doi.org/10.1016/j.tcs.2016.02.019
N2  - 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.
JF  - Theoretical Computer Science
KW  - Reversible computation; Process algebra; ?-Calculus
SN  - 0304-3975
PB  - Elsevier
VL  - 625
EP  - 84
Y1  - 2016///
SP  - 25
A1  - Lanese, Ivan
A1  - Mezzina, Claudio Antares
A1  - Stefani, Jean-Bernard
ER  -