2010 | OriginalPaper | Chapter
Reversing Higher-Order Pi
Authors : Ivan Lanese, Claudio Antares Mezzina, Jean-Bernard Stefani
Published in: CONCUR 2010 - Concurrency Theory
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
π
.