Pages that link to "Item:Q2581367"

The following pages link to A structural approach to reversible computation (Q2581367):

Displaying 21 items.

• Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
• Musings around the geometry of interaction, and coherence (Q534708) (← links)
• Fundamentals of reversible flowchart languages (Q896906) (← links)
• Undoing the effects of action sequences (Q946576) (← links)
• Reversible computation in term rewriting (Q1683707) (← links)
• Quantum walks: a comprehensive review (Q1757875) (← links)
• On one application of computations with oracle (Q1758675) (← links)
• The \(\aleph \)-calculus. A declarative model of reversible programming (Q2097425) (← links)
• From reversible programs to univalent universes and back (Q2130579) (← links)
• Reversible effects as inverse arrows (Q2134817) (← links)
• From reversible programming languages to reversible metalanguages (Q2139051) (← links)
• Reversing algebraic process calculi (Q2643334) (← links)
• Reversible computing from a programming language perspective (Q2693633) (← links)
• From Reversible to Irreversible Computations (Q2870206) (← links)
• Generating Reversible Circuits from Higher-Order Functional Programs (Q3186607) (← links)
• Isomorphic Interpreters from Logically Reversible Abstract Machines (Q3453735) (← links)
• The monoidal structure of Turing machines (Q4917187) (← links)
• lambda!-calculus, Intersection Types, and Involutions (Q5089015) (← links)
• Abelian Invertible Automata (Q5112163) (← links)
• Operational Semantics of Reversibility in Process Algebra (Q5262973) (← links)
• Compact inverse categories (Q6612798) (← links)