Collapsed tree rewriting: Completeness, confluence, and modularity
From MaRDI portal
Publication:5881178
DOI10.1007/3-540-56393-8_7OpenAlexW1515738989MaRDI QIDQ5881178
Publication date: 9 March 2023
Published in: Conditional Term Rewriting Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56393-8_7
Related Items (8)
Modularity of termination in term graph rewriting ⋮ Modularity in term rewriting revisited ⋮ Critical pairs in term graph rewriting ⋮ Modularity in noncopying term rewriting ⋮ Essentials of Term Graph Rewriting ⋮ Modular aspects of term graph rewriting ⋮ A uniform framework for term and graph rewriting applied to combined systems ⋮ Bisimilarity in term graph rewriting.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counterexamples to termination for the direct sum of term rewriting systems
- Computing in systems described by equations
- Implementing term rewriting by jungle evaluation
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Redex capturing in term graph rewriting (concise version)
- On confluence for weakly normalizing systems
- Implementing term rewriting by graph reduction: Termination of combined systems
This page was built for publication: Collapsed tree rewriting: Completeness, confluence, and modularity
