%T Controlling reversibility in higher-order pi
%P 297-311
%I Springer
%O 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings
Pages
%X We present in this paper a fine-grained rollback primitive for the higher-order ?-calculus (HO?), that builds on the reversibility apparatus of reversible HO? [9]. The definition of a proper semantics for such a primitive is a surprisingly delicate matter because of the potential interferences between concurrent rollbacks. We define in this paper a high-level operational semantics which we prove sound and complete with respect to reversible HO? backward reduction. We also define a lower-level distributed semantics, which is closer to an actual implementation of the rollback primitive, and we prove it to be fully abstract with respect to the high-level semantics.
%D 2011
%L eprints2489
%S Lecture Notes in Computer Science
%A Ivan Lanese
%A Claudio Antares Mezzina
%A Alan Schmitt
%A Jean-Bernard Stefani
%N 6901
%R 10.1007/978-3-642-23217-6_20
%B CONCUR 2011 ? Concurrency Theory