Reversible Flowchart Languages and the Structured Reversible Program Theorem
From MaRDI portal
Publication:3519506
DOI10.1007/978-3-540-70583-3_22zbMath1155.68388OpenAlexW1488362833WikidataQ62038256 ScholiaQ62038256MaRDI QIDQ3519506
Tetsuo Yokoyama, Robert Glück, Holger Bock Axelsen
Publication date: 19 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_22
Related Items
Reversibility in the higher-order \(\pi\)-calculus, One-way reversible multi-head finite automata, A categorical foundation for structured reversible flowchart languages, One-Way Reversible Multi-head Finite Automata, Constructing a binary tree from its traversals by reversible recursion and iteration, Reversible computation in term rewriting, Fundamentals of reversible flowchart languages, Tail recursion transformation for invertible functions, Reversible computing from a programming language perspective, Reversible pushdown automata, A categorical foundation for structured reversible flowchart languages: Soundness and adequacy, A Certified Study of a Reversible Programming Language