Reversibility in the higher-order π-calculus - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2016

Reversibility in the higher-order π-calculus

(1, 2) , (3) , (4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
journal-rhopi.pdf (787.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01303090 , version 1 (15-04-2016)

Identifiers

Cite

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

Relations

154 View
145 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More