Algorithmically expressive, always-terminating model for reversible computation
From MaRDI portal
Publication:6637584
DOI10.1007/978-3-031-62076-8_3MaRDI QIDQ6637584
Publication date: 13 November 2024
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)
Cites Work
- Fundamentals of reversible flowchart languages
- System \(T\), call-by-value and the minimum problem
- Linear programs in a simple reversible language.
- A unary representation result for system \(T\)
- A class of recursive permutations which is primitive recursive complete
- On the expressivity of total reversible programming languages
- Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}
- The efficiency of primitive recursive functions: a programmer's view
- A Representation Theorem for Primitive Recursive Algorithms
- Evolving Algebras 1993: Lipari Guide
- Towards a dereversibilizer: fewer asserts, statically
- Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean}
- Go to statement considered harmful
This page was built for publication: Algorithmically expressive, always-terminating model for reversible computation
