On the expressivity of total reversible programming languages

DOI10.1007/978-3-030-52482-1_7OpenAlexW3041031395MaRDI QIDQ2039893

Armando B. Matos, Luca Roversi, Luca Paolini

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-52482-1_7

zbMATH Keywords

decidabilityprimitive recursive functionsimperative programming languagesreversible programming languages

Mathematics Subject Classification ID

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

Related Items (3)

Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean} ⋮ Algorithmically expressive, always-terminating model for reversible computation ⋮ Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}

This page was built for publication: On the expressivity of total reversible programming languages