The ℵ-Calculus: A declarative model of reversible programming

06/13/2022
by   Hannah Earley, et al.
0

A novel model of reversible computing, the ℵ-calculus, is introduced. It is declarative, reversible-Turing complete, and has a local term-rewriting semantics. Unlike previously demonstrated reversible term-rewriting systems, it does not require the accumulation of history data. Terms in the ℵ-calculus, in combination with the program definitions, encapsulate all program state. An interpreter was also written.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/08/2017

Reversible Computation in Term Rewriting

Essentially, in a reversible programming language, for each forward comp...
research
05/14/2020

Structural Equivalences for Reversible Calculi of Communicating Systems (Oral communication)

The formalization of process algebras usually starts with a minimal core...
research
04/27/2018

History-Preserving Bisimulations on Reversible Calculus of Communicating Systems

History-and hereditary history-preserving bisimulation (HPB and HHPB) ar...
research
11/30/2020

The ℵ Calculus

Motivated by a need for a model of reversible computation appropriate fo...
research
10/27/2009

Temporal Debugging using URDB

A new style of temporal debugging is proposed. The new URDB debugger can...
research
11/22/2022

Reversible Programming: A Case Study of Two String-Matching Algorithms

String matching is a fundamental problem in algorithm. This study examin...
research
05/22/2018

Reversible effects as inverse arrows

Reversible computing models settings in which all processes can be rever...

Please sign up or login with your details

Forgot password? Click here to reset