What do reversible programs compute?
From MaRDI portal
Publication:3000598
Recommendations
Cited in
(28)- Small universal reversible counter machines
- Towards a taxonomy for reversible computation approaches
- Towards a reversible functional language
- On reversible combinatory logic
- A class of recursive permutations which is primitive recursive complete
- The fixed point problem of a simple reversible language
- Applying reversibility theory for the performance evaluation of reversible computations
- A categorical foundation for structured reversible flowchart languages
- A class of reversible primitive recursive functions
- En garde! Unguarded iteration for reversible computation in the delay monad
- Clean reversible simulations of ranking binary trees
- Reversible computing from a programming language perspective
- Isomorphic interpreters from logically reversible abstract machines
- A certified study of a reversible programming language
- Mathematics of Program Construction
- On reversible Turing machines and their function universality
- Information effects
- Join inverse categories as models of reversible recursion
- Reversible Flowchart Languages and the Structured Reversible Program Theorem
- Reversible Programs Have Reversible Semantics
- A categorical foundation for structured reversible flowchart languages: soundness and adequacy
- Garbage-free reversible integer multiplication with constants of the form \(2^{k}\pm 2^{l}\pm 1\)
- Fundamentals of reversible flowchart languages
- Linear programs in a simple reversible language.
- Join inverse categories and reversible recursion
- Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
- scientific article; zbMATH DE number 7584596 (Why is no real title available?)
- Programming techniques for reversible comparison sorts
This page was built for publication: What do reversible programs compute?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000598)