%A Ivan Lanese
%A Claudio Antares Mezzina
%A Jean-Bernard Stefani
%L eprints2488
%N 6269
%S Lecture Notes in Computer Science
%R 10.1007/978-3-642-15375-4_33
%D 2010
%O 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings
%B CONCUR 2010 - Concurrency Theory
%P 478-493
%T Reversing higher-order pi
%I Springer
%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 (HO?). We prove that reversibility in our calculus is causally consistent and that one can encode faithfully reversible HO? into a variant of HO?.