Article

Reversing higher-order pi

Authors:

Ivan Lanese,

Claudio Antares Mezzina,

Jean-Bernard StefaniAuthors Info & Claims

CONCUR'10: Proceedings of the 21st international conference on Concurrency theory

Pages 478 - 493

Published: 31 August 2010 Publication History

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

References

[1]

Barendregt, H.P.: The Lambda Calculus - Its Syntax and Semantics. North-Holland, Amsterdam (1984)

Google Scholar

[2]

Bennett, C.H.: Notes on the history of reversible computation. IBM Journal of Research and Development 32(1) (1988)

Digital Library

Google Scholar

[3]

Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the π-calculus. Acta Informatica 35(5) (1998)

Google Scholar

[4]

Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in pi-calculus. Nord. J. Comput. 10(2) (2003)

Digital Library

Google Scholar

[5]

Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292-307. Springer, Heidelberg (2004)

Google Scholar

[6]

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)

Digital Library

Google Scholar

[7]

Danos, V., Krivine, J., Sobocinski, P.: General reversibility. Electr. Notes Theor. Comput. Sci. 175(3) (2007)

Digital Library

Google Scholar

[8]

Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the joincalculus. In: 23rd ACM Symp. on Princ. of Prog. Languages, POPL (1996)

Digital Library

Google Scholar

[9]

Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theor. Comput. Sci. 373(3) (2007)

Digital Library

Google Scholar

[10]

Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1-2) (2007)

Google Scholar

[11]

Sangiorgi, D.: Bisimulation for higher-order process calculi. Information and Computation 131(2) (1996)

Digital Library

Google Scholar

[12]

Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)

Digital Library

Google Scholar

Cited By

View all

Montesi F(2016)Process-aware web programming with JolieScience of Computer Programming10.1016/j.scico.2016.05.002130:C(69-96)Online publication date: 15-Nov-2016
https://dl.acm.org/doi/10.1016/j.scico.2016.05.002
Cristescu IKrivine JVaracca D(2013)A Compositional Semantics for the Reversible p-CalculusProceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS.2013.45(388-397)Online publication date: 25-Jun-2013
https://dl.acm.org/doi/10.1109/LICS.2013.45
Phillips IUlidowski I(2013)Reversibility and asymmetric conflict in event structuresProceedings of the 24th international conference on Concurrency Theory10.1007/978-3-642-40184-8_22(303-318)Online publication date: 27-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40184-8_22
Show More Cited By

Recommendations

Higher-order abstract syntax in classical higher-order logic
LFMTP '09: Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice

Higher-Order Abstract Syntax, or HOAS, is a technique for using a higher-order logic as a metalanguage for an object language with binding operators. It avoids formalizing syntactic details related to variable binding. This paper gives an extension to ...
Higher Order Horn Clauses
Modal Hyperdoctrine: Higher-Order and Non-normal Extensions
Logic, Language, Information, and Computation
Abstract
Lawvere hyperdoctrines give categorical semantics for intuitionistic predicate logic but are flexible enough to be applied to other logics and extended to higher-order systems. We return to Ghilardi’s hyperdoctrine semantics for first-order modal ...

Comments

Information & Contributors

Information

Published In

CONCUR'10: Proceedings of the 21st international conference on Concurrency theory

August 2010

600 pages

ISBN:3642153747

Editors:
Paul Gastin
Laboratoire Spécification et Vérification, ENS de Cachan & CNRS, Cachan cedex, France
,
François Laroussinie
LIAFA, Université Paris Diderot, Paris cedex 13, France

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 31 August 2010

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Montesi F(2016)Process-aware web programming with JolieScience of Computer Programming10.1016/j.scico.2016.05.002130:C(69-96)Online publication date: 15-Nov-2016
https://dl.acm.org/doi/10.1016/j.scico.2016.05.002
Cristescu IKrivine JVaracca D(2013)A Compositional Semantics for the Reversible p-CalculusProceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS.2013.45(388-397)Online publication date: 25-Jun-2013
https://dl.acm.org/doi/10.1109/LICS.2013.45
Phillips IUlidowski I(2013)Reversibility and asymmetric conflict in event structuresProceedings of the 24th international conference on Concurrency Theory10.1007/978-3-642-40184-8_22(303-318)Online publication date: 27-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40184-8_22
Phillips IUlidowski IYuen S(2013)Modelling of bonding with processes and eventsProceedings of the 5th international conference on Reversible Computation10.1007/978-3-642-38986-3_12(141-154)Online publication date: 4-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-38986-3_12
Lanese ILienhardt MMezzina CSchmitt AStefani J(2013)Concurrent flexible reversibilityProceedings of the 22nd European conference on Programming Languages and Systems10.1007/978-3-642-37036-6_21(370-390)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1007/978-3-642-37036-6_21
Bruni RFerreira CKersten Kauer A(2012)First-Order dynamic logic for compensable processesProceedings of the 14th international conference on Coordination Models and Languages10.1007/978-3-642-30829-1_8(104-121)Online publication date: 14-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30829-1_8
Lienhardt MLanese IMezzina CStefani J(2012)A reversible abstract machine and its space overheadProceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems10.1007/978-3-642-30793-5_1(1-17)Online publication date: 13-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30793-5_1
Crafa SVaracca DYoshida N(2012)Event structure semantics of parallel extrusion in the pi-calculusProceedings of the 15th international conference on Foundations of Software Science and Computational Structures10.1007/978-3-642-28729-9_15(225-239)Online publication date: 24-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28729-9_15
Lanese IMezzina CSchmitt AStefani J(2011)Controlling reversibility in higher-order PiProceedings of the 22nd international conference on Concurrency theory10.5555/2040235.2040261(297-311)Online publication date: 6-Sep-2011
https://dl.acm.org/doi/10.5555/2040235.2040261
Bacci GDanos VKammar O(2011)On the statistical thermodynamics of reversible communicating processesProceedings of the 4th international conference on Algebra and coalgebra in computer science10.5555/2040096.2040098(1-18)Online publication date: 30-Aug-2011
https://dl.acm.org/doi/10.5555/2040096.2040098
Show More Cited By

Abstract

References

Cited By

Recommendations

Higher-order abstract syntax in classical higher-order logic

Higher Order Horn Clauses

Modal Hyperdoctrine: Higher-Order and Non-normal Extensions

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations