A categorical foundation for structured reversible flowchart languages: Soundness and adequacy

DOI10.23638/LMCS-14(3:16)2018zbMath1398.68082arXiv1710.03666OpenAlexW2963865229MaRDI QIDQ4585070

Robert Glück, Robin Kaarsgaard

Publication date: 6 September 2018

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

zbMATH Keywords

category theorycategorical semanticsreversible computingstructured programmingflowchart languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50)

Related Items (6)

Condition/decision duality and the internal logic of extensive restriction categories ⋮ From reversible programming languages to reversible metalanguages ⋮ The Category TOF ⋮ Tail recursion transformation for invertible functions ⋮ Reversible computing from a programming language perspective ⋮ A categorical foundation for structured reversible flowchart languages: Soundness and adequacy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Join inverse categories and reversible recursion
• The universal resolving algorithm and its correctness: Inverse computation in a functional language
• Fundamentals of reversible flowchart languages
• Introduction to extensive and distributive categories
• Restriction categories II: Partial map classification
• Implementing reversible object-oriented language features on reversible machines
• A categorical foundation for structured reversible flowchart languages
• Join Inverse Categories as Models of Reversible Recursion
• Dagger Compact Closed Categories and Completely Positive Maps
• Towards a Reversible Functional Language
• What Do Reversible Programs Compute?
• A Survey of Graphical Languages for Monoidal Categories
• Reversible arithmetic logic unit for quantum arithmetic
• New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic
• Reversible Machine Code and Its Abstract Processor Architecture
• Reversible Flowchart Languages and the Structured Reversible Program Theorem
• Full abstraction, totality and PCF
• A categorical foundation for structured reversible flowchart languages: Soundness and adequacy
• Traced monoidal categories
• Logical Reversibility of Computation
• Restriction categories III: colimits, partial limits and extensivity
• Programming Languages and Systems
• Restriction categories. I: Categories of partial maps

This page was built for publication: A categorical foundation for structured reversible flowchart languages: Soundness and adequacy