Reversible computation in term rewriting
From MaRDI portal
Publication:1683707
DOI10.1016/j.jlamp.2017.10.003zbMath1381.68107arXiv1710.02804OpenAlexW2763395989WikidataQ57573902 ScholiaQ57573902MaRDI QIDQ1683707
Naoki Nishida, Germán Vidal, Adrián Palacios
Publication date: 1 December 2017
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.02804
Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Controlled reversibility in communicating reaction systems, Semi-inversion of Conditional Constructor Term Rewriting Systems, Towards a taxonomy for reversible computation approaches, Reversible computing from a programming language perspective, Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems, Characterizing Compatible View Updates in Syntactic Bidirectionalization
Cites Work
- Unnamed Item
- Unnamed Item
- One-way reversible and quantum finite automata with advice
- Reversible simulation of one-dimensional irreversible cellular automata
- Reversible simulation of space-bounded computations
- Fundamentals of reversible flowchart languages
- Conditional rewrite rules: Confluence and termination
- Computation and construction universality of reversible cellular automata
- Completeness results for basic narrowing
- Determinization of conditional term rewriting systems
- Fundamental approaches to software engineering. 17th international conference, FASE 2014, held as part of the European joint conferences on theory and practice of software, ETAPS 2014, Grenoble, France, April 5--13, 2014, Proceedings
- A structural approach to reversible computation
- Reverse Code Generation for Parallel Discrete Event Simulation
- Computation in reversible cellular automata
- Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
- Reversible Flowchart Languages and the Structured Reversible Program Theorem
- Automated Complexity Analysis Based on the Dependency Pair Method
- Automatic Partial Inversion of Inductively Sequential Functions
- Irreversibility and Heat Generation in the Computing Process
- Update semantics of relational views
- Reachability in Conditional Term Rewriting Systems
- Bidirectionalization transformation based on automatic derivation of view complement functions
- Mathematics of Program Construction
- Reversible Term Rewriting
- Program Inversion for Tail Recursive Functions
- Reversible combinatory logic
- Logical Reversibility of Computation
