Modular aspects of term graph rewriting
From MaRDI portal
Publication:1275016
DOI10.1016/S0304-3975(98)00079-6zbMath0912.68100OpenAlexW2019331674MaRDI QIDQ1275016
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00079-6
Related Items
Essentials of Term Graph Rewriting, Some characteristics of strong innermost normalization, A uniform framework for term and graph rewriting applied to combined systems, Bisimilarity in term graph rewriting.
Cites Work
- Modularity in noncopying term rewriting
- Modular properties of conditional term rewriting systems
- Counterexamples to termination for the direct sum of term rewriting systems
- Modularity of simple termination of term rewriting systems with shared constructors
- Generalized sufficient conditions for modular termination of rewriting
- Modular proofs for completeness of hierarchical term rewriting systems
- Modular properties of composable term rewriting systems
- Completeness of combinations of constructor systems
- Graph reducibility of term rewriting systems
- Modularity of termination in term graph rewriting
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- Critical pairs in term graph rewriting
- On the Church-Rosser property for the direct sum of term rewriting systems
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
