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 pi-calculus (HOpi). We prove that reversibility in our calculus is causally consistent and that one can encode faithfully reversible HOpi into a variant of HOpi.
Reversing Higher-Order Pi / I. LANESE; C. A. MEZZINA; J. STEFANI. - STAMPA. - 6269:(2010), pp. 478-493. (Intervento presentato al convegno 21th International Conference on Concurrency Theory - CONCUR 2010 tenutosi a Parigi, Francia nel 31/8/2010 - 3/9/2010) [10.1007/978-3-642-15375-4_33].
Reversing Higher-Order Pi
LANESE, IVAN;
2010
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 pi-calculus (HOpi). We prove that reversibility in our calculus is causally consistent and that one can encode faithfully reversible HOpi into a variant of HOpi.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
