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π.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barendregt, H.P.: The Lambda Calculus – Its Syntax and Semantics. North-Holland, Amsterdam (1984)
Bennett, C.H.: Notes on the history of reversible computation. IBM Journal of Research and Development 32(1) (1988)
Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the π-calculus. Acta Informatica 35(5) (1998)
Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in pi-calculus. Nord. J. Comput. 10(2) (2003)
Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004)
Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398–412. Springer, Heidelberg (2005)
Danos, V., Krivine, J., Sobocinski, P.: General reversibility. Electr. Notes Theor. Comput. Sci. 175(3) (2007)
Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: 23rd ACM Symp. on Princ. of Prog. Languages, POPL (1996)
Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theor. Comput. Sci. 373(3) (2007)
Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1-2) (2007)
Sangiorgi, D.: Bisimulation for higher-order process calculi. Information and Computation 131(2) (1996)
Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lanese, I., Mezzina, C.A., Stefani, JB. (2010). Reversing Higher-Order Pi. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-15375-4_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15374-7
Online ISBN: 978-3-642-15375-4
eBook Packages: Computer ScienceComputer Science (R0)