论文信息 - Reversing Higher-Order Pi

Reversing Higher-Order Pi

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π.

[1] Cédric Fournet,et al. The reflexive CHAM and the join-calculus , 1996, POPL '96.

[2] Vincent Danos,et al. Transactions in RCCS , 2005, CONCUR.

[3] Davide Sangiorgi,et al. Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[4] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .

[5] Sergio Maffeis,et al. On the Expressive Power of Polyadic Synchronisation in pi-calculus , 2002, EXPRESS.

[6] Davide Sangiorgi,et al. A fully abstract semantics for causality in the $\pi$-calculus , 1998, Acta Informatica.

[7] Vincent Danos,et al. Reversible Communicating Systems , 2004, CONCUR.

[8] Iain C. C. Phillips,et al. Reversing algebraic process calculi , 2007, J. Log. Algebraic Methods Program..

[9] Davide Sangiorgi,et al. The Pi-Calculus - a theory of mobile processes , 2001 .

[10] Charles H. Bennett. Notes on the history of reversible computation , 2000, IBM J. Res. Dev..

[11] Jan Friso Groote,et al. SOS formats and meta-theory: 20 years after , 2007, Theor. Comput. Sci..

[12] Vincent Danos,et al. General Reversibility , 2006, EXPRESS.