Skip to Main content Skip to Navigation
Journal articles

Reversibility in the higher-order π-calculus

Ivan Lanese 1, 2 Claudio Antares Mezzina 3 Jean-Bernard Stefani 4
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
4 SPADES - Sound Programming of Adaptive Dependable Embedded Systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
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 π-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.
Complete list of metadata

Cited literature [74 references]  Display  Hide  Download
Contributor : Jean-Bernard Stefani Connect in order to contact the contributor
Submitted on : Friday, April 15, 2016 - 7:24:38 PM
Last modification on : Wednesday, November 3, 2021 - 6:44:55 AM
Long-term archiving on: : Tuesday, November 15, 2016 - 4:53:16 AM


Files produced by the author(s)




Ivan Lanese, Claudio Antares Mezzina, Jean-Bernard Stefani. Reversibility in the higher-order π-calculus. Theoretical Computer Science, Elsevier, 2016, 625, pp.25-84. ⟨10.1016/j.tcs.2016.02.019⟩. ⟨hal-01303090⟩



Record views


Files downloads