The ℵ-Calculus: A declarative model of reversible programming

06/13/2022

∙

by   Hannah Earley, et al.

∙

0

∙

share

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.