A class of reversible primitive recursive functions
From MaRDI portal
Publication:737109
DOI10.1016/J.ENTCS.2016.03.016zbMATH Open1345.03078DBLPjournals/entcs/PaoliniPR16OpenAlexW2314307518WikidataQ57722143 ScholiaQ57722143MaRDI QIDQ737109FDOQ737109
Authors: Luca Paolini, Mauro Piccolo, Luca Roversi 
Publication date: 5 August 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2016.03.016
Recommendations
Cites Work
- Title not available (Why is that?)
- Irreversibility and Heat Generation in the Computing Process
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logical Reversibility of Computation
- Title not available (Why is that?)
- What do reversible programs compute?
- Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
- Classical recursion theory. The theory of functions and sets of natural numbers
- Title not available (Why is that?)
- Generation of invertible functions
- Linear programs in a simple reversible language.
- Title not available (Why is that?)
Cited In (11)
- A certified study of a reversible programming language
- Quantum programming made easy
- A class of recursive permutations which is primitive recursive complete
- The fixed point problem of a simple reversible language
- QPCF: higher-order languages and quantum circuits
- Title not available (Why is that?)
- Reversible Functional Array Programming
- What do reversible programs compute?
- A type-assignment of linear erasure and duplication
- Title not available (Why is that?)
- \textsc{qPCF}: a language for quantum circuit computations
This page was built for publication: A class of reversible primitive recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q737109)
