A structural approach to reversible computation

DOI10.1016/j.tcs.2005.07.002zbMath1081.68019arXiv1111.7154OpenAlexW2015392385WikidataQ57006662 ScholiaQ57006662MaRDI QIDQ2581367

Samson Abramsky

Publication date: 10 January 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.7154

zbMATH Keywords

AutomataGeometry of InteractionReversible computationLinear combinatory algebraTerm-rewriting

Mathematics Subject Classification ID

Related Items (21)

Reversibility in the higher-order \(\pi\)-calculus ⋮ From reversible programs to univalent universes and back ⋮ Reversible effects as inverse arrows ⋮ From reversible programming languages to reversible metalanguages ⋮ Isomorphic Interpreters from Logically Reversible Abstract Machines ⋮ Generating Reversible Circuits from Higher-Order Functional Programs ⋮ Reversing algebraic process calculi ⋮ Reversible computation in term rewriting ⋮ Fundamentals of reversible flowchart languages ⋮ Towards a taxonomy for reversible computation approaches ⋮ Abelian Invertible Automata ⋮ Reversible computing from a programming language perspective ⋮ Undoing the effects of action sequences ⋮ The monoidal structure of Turing machines ⋮ Quantum walks: a comprehensive review ⋮ On one application of computations with oracle ⋮ Musings around the geometry of interaction, and coherence ⋮ lambda!-calculus, Intersection Types, and Involutions ⋮ The \(\aleph \)-calculus. A declarative model of reversible programming ⋮ Operational Semantics of Reversibility in Process Algebra ⋮ From Reversible to Irreversible Computations

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear realizability and full completeness for typed lambda-calculi
• Linear logic
• The semantics and proof theory of linear logic
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• New foundations for the geometry of interaction
• Reversible, irreversible and optimal \(\lambda\)-machines
• Full abstraction for PCF
• Database query languages embedded in the typed lambda calculus
• Irreversibility and Heat Generation in the Computing Process
• Categories for Types
• Games and full completeness for multiplicative linear logic
• Applying dispersion correction to numerical approximations of the two‐dimensional wave equation ‐ eigenproblems
• Automatic Sequences
• Unique decomposition categories, Geometry of Interaction and combinatory logic
• Term Rewriting and All That
• Geometry of Interaction and linear combinatory algebras
• Traced monoidal categories
• Logical Reversibility of Computation
• Retracing some paths in process algebra

This page was built for publication: A structural approach to reversible computation