pith. sign in

arxiv: 1608.05521 · v1 · pith:WN7JAFW6new · submitted 2016-08-19 · 💻 cs.PL · cs.LO

Towards Reversible Computation in Erlang

classification 💻 cs.PL cs.LO
keywords reversibleerlanglanguagebeencomputationsemanticsactorattempt
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.