Splitting Recursion Schemes into Reversible and Classical Interacting Threads

DOI10.1007/978-3-030-79837-6_12OpenAlexW3173876742MaRDI QIDQ5162610

Luca Roversi, Luca Paolini, 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

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

Cites Work

• Improving recursive functions by inverting the order of evaluation
• Linear programs in a simple reversible language.
• The fixed point problem of a simple reversible language
• A class of recursive permutations which is primitive recursive complete
• Reverse Code Generation for Parallel Discrete Event Simulation
• Information effects

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