A theory of reversibility for Erlang
From MaRDI portal
Publication:1785852
DOI10.1016/j.jlamp.2018.06.004zbMath1400.68046arXiv1806.07100OpenAlexW2809465996WikidataQ57573896 ScholiaQ57573896MaRDI QIDQ1785852
Adrián Palacios, Germán Vidal, Naoki Nishida, Ivan Lanese
Publication date: 1 October 2018
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.07100
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)
Related Items (20)
Towards Bridging Time and Causal Reversibility ⋮ Controlled reversibility in communicating reaction systems ⋮ Computing race variants in message-passing concurrent programming with selective receives ⋮ Prefix-based tracing in message-passing concurrency ⋮ Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach ⋮ A model of actors and grey failures ⋮ Reversing Unbounded Petri Nets ⋮ Towards a taxonomy for reversible computation approaches ⋮ Causal-consistent replay debugging for message passing programs ⋮ Reversible debugging of concurrent Erlang programs: supporting imperative primitives ⋮ An axiomatic approach to reversible computation ⋮ Program equivalence in an untyped, call-by-value functional language with uncurried functions ⋮ Declarative debugging of concurrent Erlang programs ⋮ Causal-Consistent Debugging of Distributed Erlang Programs ⋮ Forward-Reverse Observational Equivalences in CCSK ⋮ Unnamed Item ⋮ Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs ⋮ Reversible Imperative Parallel Programs and Debugging ⋮ A core Erlang semantics for declarative debugging ⋮ Reversibility in Erlang: imperative constructs
Uses Software
Cites Work
- Unnamed Item
- Reversibility in the higher-order \(\pi\)-calculus
- Reversible session-based pi-calculus
- Cauder: a causal-consistent reversible debugger for Erlang
- A reversible semantics for Erlang
- Reversing algebraic process calculi
- Controlling Reversibility in Higher-Order Pi
- Irreversibility and Heat Generation in the Computing Process
- Term Rewriting and All That
- Bidirectionalization transformation based on automatic derivation of view complement functions
- A Compositional Semantics for the Reversible p-Calculus
- Transactors
- CONCUR 2004 - Concurrency Theory
- Reversible Term Rewriting
- Tree-Manipulating Systems and Church-Rosser Theorems
- Logical Reversibility of Computation
- CONCUR 2005 – Concurrency Theory
This page was built for publication: A theory of reversibility for Erlang
