eprintid: 2488
rev_number: 6
eprint_status: archive
userid: 6
dir: disk0/00/00/24/88
datestamp: 2015-01-15 13:06:00
lastmod: 2015-01-15 13:06:00
status_changed: 2015-01-15 13:06:00
type: book_section
metadata_visibility: show
creators_name: Lanese, Ivan
creators_name: Mezzina, Claudio Antares
creators_name: Stefani, Jean-Bernard
creators_id: 
creators_id: claudio.mezzina@imtlucca.it
creators_id: 
title: Reversing higher-order pi
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings
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π.
date: 2010
series: Lecture Notes in Computer Science
number: 6269
publisher: Springer
pagerange: 478-493
id_number: 10.1007/978-3-642-15375-4_33
refereed: TRUE
isbn: 978-3-642-15375-4
book_title: CONCUR 2010 - Concurrency Theory
official_url: http://dx.doi.org/10.1007/978-3-642-15375-4_33
citation:   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)