TY  - CHAP
PB  - Springer
Y1  - 2010///
UR  - http://dx.doi.org/10.1007/978-3-642-15375-4_33
A1  - Lanese, Ivan
A1  - Mezzina, Claudio Antares
A1  - Stefani, Jean-Bernard
T2  - CONCUR 2010 - Concurrency Theory
SN  - 978-3-642-15375-4
N1  - 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings
AV  - none
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 (HO?). We prove that reversibility in our calculus is causally consistent and that one can encode faithfully reversible HO? into a variant of HO?.
T3  - Lecture Notes in Computer Science
SP  - 478
TI  - Reversing higher-order pi
EP  - 493
ID  - eprints2488
ER  -