The -Calculus: A declarative model of reversible programming
arXiv:2206.05957
Abstract
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.
7 pages, 1 listing, 14th Conference on Reversible Computation