Modularity in noncopying term rewriting
From MaRDI portal
Publication:673186
DOI10.1016/0304-3975(94)00248-3zbMath0872.68075OpenAlexW2078372985MaRDI QIDQ673186
Azuma Ohuchi, Masahito Kurihara
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00248-3
modular properties of term rewriting systemsmodularity of termination and of completenessterminating term rewriting systems
Related Items
Modularity of termination in term graph rewriting ⋮ Modularity in term rewriting revisited ⋮ Interaction nets and term-rewriting systems ⋮ Implementing conditional term rewriting by graph rewriting ⋮ Modular aspects of term graph rewriting ⋮ A uniform framework for term and graph rewriting applied to combined systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular properties of conditional term rewriting systems
- Counterexamples to termination for the direct sum of term rewriting systems
- On termination of the direct sum of term-rewriting systems
- Computing in systems described by equations
- Modularity of simple termination of term rewriting systems with shared constructors
- LEAN: An intermediate language based on graph rewriting
- Completeness of combinations of constructor systems
- REDEX CAPTURING IN TERM GRAPH REWRITING
- Proving termination with multiset orderings
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Termination for direct sums of left-linear complete term rewriting systems
- Modular aspects of properties of term rewriting systems related to normal forms
- On the Church-Rosser property for the direct sum of term rewriting systems
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Implementing term rewriting by graph reduction: Termination of combined systems
