Algorithmically expressive, always-terminating model for reversible computation

DOI10.1007/978-3-031-62076-8_3MaRDI QIDQ6637584zbMATH OpenFDO

Authors Matteo Palazzo, Luca Roversi

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-62076-8_3

zbMATH Keywords

algorithmic expressivenessloop-languageprimitive recursive functionsreversible computation

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites work

• A class of recursive permutations which is primitive recursive complete
• A representation theorem for primitive recursive algorithms
• A unary representation result for system \(T\)
• Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}
• Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean}
• Evolving Algebras 1993: Lipari Guide
• Fundamentals of reversible flowchart languages
• Go to statement considered harmful
• Linear programs in a simple reversible language.
• On the expressivity of total reversible programming languages
• System \(T\), call-by-value and the minimum problem
• The efficiency of primitive recursive functions: a programmer's view
• Towards a dereversibilizer: fewer asserts, statically

This page was built for publication: Algorithmically expressive, always-terminating model for reversible computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637584)