Pages that link to "Item:Q3519506"
From MaRDI portal
The following pages link to Reversible Flowchart Languages and the Structured Reversible Program Theorem (Q3519506):
Displaying 13 items.
- Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- Reversible computation in term rewriting (Q1683707) (← links)
- Reversible pushdown automata (Q1757838) (← links)
- A categorical foundation for structured reversible flowchart languages (Q2130590) (← links)
- One-way reversible multi-head finite automata (Q2358688) (← links)
- Constructing a binary tree from its traversals by reversible recursion and iteration (Q2414043) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- One-Way Reversible Multi-head Finite Automata (Q3453731) (← links)
- A Certified Study of a Reversible Programming Language (Q4580228) (← links)
- A categorical foundation for structured reversible flowchart languages: Soundness and adequacy (Q4585070) (← links)
- Reversible Top-Down Syntax Analysis (Q6169965) (← links)
- Connecting reversible and classical computing through hybrid SSA (Q6637595) (← links)