Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Reversibility in the higher-order π-calculus

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 un-dertaken by Danos and Krivine on reversible CCS by defining a reversible higher-order π-calculus, called rhoπ. We prove that reversibility in our cal-culus 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 metadatas

Cited literature [72 references]  Display  Hide  Download
Contributor : Jean-Bernard Stefani <>
Submitted on : Monday, November 10, 2014 - 4:13:12 PM
Last modification on : Monday, September 28, 2020 - 5:32:01 PM
Long-term archiving on: : Wednesday, February 11, 2015 - 3:38:20 PM


Files produced by the author(s)


  • HAL Id : hal-01081714, version 1



Ivan Lanese, Claudio Antares Mezzina, Jean-Bernard Stefani. Reversibility in the higher-order π-calculus. 2014. ⟨hal-01081714⟩



Record views


Files downloads