What Do Reversible Programs Compute?

DOI10.1007/978-3-642-19805-2_4zbMath1326.68134OpenAlexW1592460780WikidataQ62038239 ScholiaQ62038239MaRDI QIDQ3000598

Robert Glück, Holger Bock Axelsen

Publication date: 19 May 2011

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_4

Mathematics Subject Classification ID

Related Items (16)

A categorical foundation for structured reversible flowchart languages ⋮ On reversible Turing machines and their function universality ⋮ Isomorphic Interpreters from Logically Reversible Abstract Machines ⋮ Garbage-Free Reversible Integer Multiplication with Constants of the Form 2 k ±2 l ±1 ⋮ Unnamed Item ⋮ Fundamentals of reversible flowchart languages ⋮ Clean Reversible Simulations of Ranking Binary Trees ⋮ Small Universal Reversible Counter Machines ⋮ Reversible computing from a programming language perspective ⋮ The fixed point problem of a simple reversible language ⋮ A class of recursive permutations which is primitive recursive complete ⋮ Join inverse categories and reversible recursion ⋮ A categorical foundation for structured reversible flowchart languages: Soundness and adequacy ⋮ A class of reversible primitive recursive functions ⋮ Join Inverse Categories as Models of Reversible Recursion ⋮ A Certified Study of a Reversible Programming Language

This page was built for publication: What Do Reversible Programs Compute?