Splitting Recursion Schemes into Reversible and Classical Interacting Threads

DOI10.1007/978-3-030-79837-6_12MaRDI QIDQ5162610zbMATH OpenOpenAlexFDO

Authors Luca Paolini, Luca Roversi, Armando B. Matos

Publication date 3 November 2021

Published in Reversible Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.04910

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
• Improving recursive functions by inverting the order of evaluation
• Information effects
• Linear programs in a simple reversible language.
• Reverse code generation for parallel discrete event simulation
• The fixed point problem of a simple reversible language

This page was built for publication: Splitting Recursion Schemes into Reversible and Classical Interacting Threads

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