Notes on the history of reversible computation
IBM Journal of Research and Development
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation for higher-order process calculi
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
CONCUR 2005 - Concurrency Theory
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 9th International Conference on Computational Methods in Systems Biology
On the statistical thermodynamics of reversible communicating processes
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Controlling reversibility in higher-order Pi
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Event structure semantics of parallel extrusion in the pi-calculus
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
A reversible abstract machine and its space overhead
FMOODS'12/FORTE'12 Proceedings 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 Systems
First-Order dynamic logic for compensable processes
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Concurrent flexible reversibility
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Modelling of bonding with processes and events
RC'13 Proceedings of the 5th international conference on Reversible Computation
Reversibility and asymmetric conflict in event structures
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A Compositional Semantics for the Reversible p-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
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π.