Lanese, Ivan and Mezzina, Claudio Antares and Stefani, Jean-Bernard Reversing higher-order pi. In: CONCUR 2010 - Concurrency Theory. Lecture Notes in Computer Science (6269). Springer, pp. 478-493. ISBN 978-3-642-15375-4 (2010)
Full text not available from this repository.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 (HOπ). We prove that reversibility in our calculus is causally consistent and that one can encode faithfully reversible HOπ into a variant of HOπ.
Item Type: | Book Section |
---|---|
Identification Number: | https://doi.org/10.1007/978-3-642-15375-4_33 |
Additional Information: | 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Research Area: | Computer Science and Applications |
Depositing User: | Ms T. Iannizzi |
Date Deposited: | 15 Jan 2015 13:06 |
Last Modified: | 15 Jan 2015 13:06 |
URI: | http://eprints.imtlucca.it/id/eprint/2488 |
Actions (login required)
Edit Item |