A novel model of reversible computing, the $\aleph$-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 $\aleph$-calculus, in combination with the program definitions, encapsulate all program state. An interpreter was also written.
翻译:引入了一个新的可逆计算模型,即 $\ aleph$- calculus 。 它具有宣示性、 可逆性- Turing 完整, 并具有本地的用词重写语义。 与先前演示的可逆性术语重写系统不同, 它不需要历史数据的积累。 $\ aleph$- calculus 中的术语, 结合程序定义, 包涵了所有程序状态。 也写了译员 。