The $\aleph$-Calculus: A declarative model of reversible programming
Programming Languages
2022-06-14 v1
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.
Cite
@article{arxiv.2206.05957,
title = {The $\aleph$-Calculus: A declarative model of reversible programming},
author = {Hannah Earley},
journal= {arXiv preprint arXiv:2206.05957},
year = {2022}
}
Comments
7 pages, 1 listing, 14th Conference on Reversible Computation