Towards Reversible Computation in Erlang
Programming Languages
2016-08-22 v1 Logic in Computer Science
Abstract
In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for debugging and for enforcing fault-tolerance, among others. In this paper, we consider a subset of Erlang, a concurrent language based on the actor model. We formally introduce a reversible semantics for this language. To the best of our knowledge, this is the first attempt to define a reversible semantics for Erlang.
Cite
@article{arxiv.1608.05521,
title = {Towards Reversible Computation in Erlang},
author = {Naoki Nishida and Adrián Palacios and Germán Vidal},
journal= {arXiv preprint arXiv:1608.05521},
year = {2016}
}
Comments
Pre-proceedings paper presented at the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Edinburgh, Scotland UK, 6-8 September 2016 (arXiv:1608.02534)