%T Reversibility in the higher-order \(?\)-calculus
%J Theoretical Computer Science
%P 25-84
%V 625
%L eprints3346
%K Reversible computation; Process algebra; ?-Calculus
%X 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.
%I Elsevier
%D 2016
%A Ivan Lanese
%A Claudio Antares Mezzina
%A Jean-Bernard Stefani