On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions

@article{Paolini2018OnAC,
  title={On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions},
  author={Luca Paolini and M. Piccolo and L. Roversi},
  journal={New Generation Computing},
  year={2018},
  volume={36},
  pages={233-256}
}
Reversible computing is both forward and backward deterministic. This means that a uniquely determined step exists from the previous computational configuration (backward determinism) to the next one (forward determinism) and vice versa. We present the reversible primitive recursive functions (RPRF), a class of reversible (endo-)functions over natural numbers which allows to capture interesting extensional aspects of reversible computation in a formalism quite close to that of classical… Expand
12 Citations
A class of Recursive Permutations which is Primitive Recursive complete
  • 1
  • PDF
The fixed point problem of a simple reversible language
  • 2
On the Expressivity of Total Reversible Programming Languages
  • 2
  • PDF
Reversible Computing: Foundations and Software
  • PDF
A type-assignment of linear erasure and duplication
  • PDF
QPCF: Higher-Order Languages and Quantum Circuits
  • 10
  • PDF
Interleaving classical and reversible
  • Highly Influenced
  • PDF
Cantor pairing in a reversible programming language
Quantum programming made easy
  • 8
  • PDF
Introducing Yet Another REversible Language
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 43 REFERENCES
A Class of Reversible Primitive Recursive Functions
  • 17
  • PDF
A class of Recursive Permutations which is Primitive Recursive complete
  • 6
  • PDF
On reversible Turing machines and their function universality
  • 12
  • Highly Influential
What Do Reversible Programs Compute?
  • 46
  • PDF
Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
  • 11
Logical reversibility of computation
  • 3,254
  • PDF
Reversible combinatory logic
  • 12
A Structural Approach to Reversible Computation
  • S. Abramsky
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2005
  • 84
  • PDF
Principles of a reversible programming language
  • 109
Reversible Computation
  • 1
  • Highly Influential
...
1
2
3
4
5
...