Fundamentals of reversible flowchart languages
DOI10.1016/J.TCS.2015.07.046zbMATH Open1332.68028DBLPjournals/tcs/YokoyamaAG16OpenAlexW950576007WikidataQ62038216 ScholiaQ62038216MaRDI QIDQ896906FDOQ896906
Holger Bock Axelsen, Tetsuo Yokoyama, Robert Glück
Publication date: 15 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.046
reversible computingprogram inversionstructured programmingflowchartr-Turing-completenessstructured program theorem
Theory of programming languages (68N15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- FliPpr: A Prettier Invertible Printing System
- Conservative logic
- Theory of cellular automata: a survey
- A structural approach to reversible computation
- Reversing algebraic process calculi
- Towards a Reversible Functional Language
- Information effects
- Reversible Flowchart Languages and the Structured Reversible Program Theorem
- Irreversibility and Heat Generation in the Computing Process
- A formal approach to undo operations in programming languages
- CONCUR 2004 - Concurrency Theory
- Mathematics of Program Construction
- Logical Reversibility of Computation
- Reversible computing and cellular automata -- a survey
- Reversible arithmetic logic unit for quantum arithmetic
- Towards a Design Flow for Reversible Logic
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- What Do Reversible Programs Compute?
- A Simple and Efficient Universal Reversible Turing Machine
- Reversible Machine Code and Its Abstract Processor Architecture
- A Universal Reversible Turing Machine
- Functional and Logic Programming
- Programming Languages and Systems
- Synthesis and optimization of reversible circuits -- a survey
- A programmable editor for developing structured documents based on bidirectional transformations
- Flow diagrams, turing machines and languages with only two formation rules
- Reversible Computing
- Computation and construction universality of reversible cellular automata
- Time/Space Trade-Offs for Reversible Computation
- Term Rewriting and Applications
- Linear programs in a simple reversible language.
- Reversible Representation and Manipulation of Constructor Terms in the Heap
- Reversible combinatory logic
Cited In (18)
- Optimizing reversible programs
- Optimization of reversible control flow graphs
- Towards a taxonomy for reversible computation approaches
- Towards a dereversibilizer: fewer asserts, statically
- Reversible computing from a programming language perspective
- On reversible Turing machines and their function universality
- Title not available (Why is that?)
- From reversible programming languages to reversible metalanguages
- Compiling Janus to RSSA
- Algorithmically expressive, always-terminating model for reversible computation
- Reversible computation in term rewriting
- A categorical foundation for structured reversible flowchart languages
- A categorical foundation for structured reversible flowchart languages: Soundness and adequacy
- Categorical semantics of reversible pattern-matching
- Join inverse rig categories for reversible functional programming, and beyond
- Join inverse categories and reversible recursion
- Towards causal-consistent reversibility of imperative concurrent programs
- Condition/decision duality and the internal logic of extensive restriction categories
Uses Software
This page was built for publication: Fundamentals of reversible flowchart languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896906)
