Characterizing Compatible View Updates in Syntactic Bidirectionalization
From MaRDI portal
Publication:5237214
DOI10.1007/978-3-030-21500-2_5OpenAlexW2953268725MaRDI QIDQ5237214
Publication date: 17 October 2019
Published in: Reversible Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-21500-2_5
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (2)
Towards a taxonomy for reversible computation approaches ⋮ Characterizing Compatible View Updates in Syntactic Bidirectionalization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The universal resolving algorithm and its correctness: Inverse computation in a functional language
- Deforestation: Transforming programs to eliminate trees
- Termination of narrowing via termination of rewriting
- Conditional rewrite rules: Confluence and termination
- Order-sorted completion: The many-sorted way
- Reversible computation in term rewriting
- Determinization of conditional term rewriting systems
- Reversing algebraic process calculi
- Automated Complexity Analysis Based on the Dependency Pair Method
- Irreversibility and Heat Generation in the Computing Process
- Update semantics of relational views
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Three Complementary Approaches to Bidirectional Programming
- Term Rewriting and All That
- Bidirectionalization transformation based on automatic derivation of view complement functions
- Matching lenses
- Bidirectionalizing graph transformations
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
- Bidirectionalization for free! (Pearl)
- Combinators for bi-directional tree transformations
- CONCUR 2004 - Concurrency Theory
- Mappings and grammars on trees
- Programming Languages and Systems
This page was built for publication: Characterizing Compatible View Updates in Syntactic Bidirectionalization
