A categorical foundation for structured reversible flowchart languages

DOI10.1016/j.entcs.2018.03.021OpenAlexW2800422733WikidataQ62038199 ScholiaQ62038199MaRDI QIDQ2130590

Robert Glück, Robin Kaarsgaard

Publication date: 25 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2018.03.021

zbMATH Keywords

category theorydenotational semanticsreversible computingstructured programmingflowchart languages

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Condition/decision duality and the internal logic of extensive restriction categories ⋮ A categorical foundation for structured reversible flowchart languages: Soundness and adequacy

Cites Work

• Unnamed Item
• Unnamed Item
• Join inverse categories and reversible recursion
• Introduction to extensive and distributive categories
• Restriction categories II: Partial map classification
• 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
• Traced monoidal categories
• Restriction categories III: colimits, partial limits and extensivity
• Programming Languages and Systems
• Restriction categories. I: Categories of partial maps