Modularity in noncopying term rewriting
From MaRDI portal
Publication:673186
DOI10.1016/0304-3975(94)00248-3zbMATH Open0872.68075OpenAlexW2078372985MaRDI QIDQ673186FDOQ673186
Authors: Masahito Kurihara, Azuma Ohuchi 
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
Recommendations
modular properties of term rewriting systemsmodularity of termination and of completenessterminating term rewriting systems
Cites Work
- Proving termination with multiset orderings
- Title not available (Why is that?)
- LEAN: An intermediate language based on graph rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular properties of conditional term rewriting systems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Title not available (Why is that?)
- Counterexamples to termination for the direct sum of term rewriting systems
- Computing in systems described by equations
- Title not available (Why is that?)
- On the Church-Rosser property for the direct sum of term rewriting systems
- REDEX CAPTURING IN TERM GRAPH REWRITING
- Termination for direct sums of left-linear complete term rewriting systems
- On termination of the direct sum of term-rewriting systems
- Modularity of simple termination of term rewriting systems with shared constructors
- Completeness of combinations of constructor systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular aspects of properties of term rewriting systems related to normal forms
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Implementing term rewriting by graph reduction: Termination of combined systems
Cited In (9)
- Modularity in term rewriting revisited
- Modular aspects of term graph rewriting
- Implementing conditional term rewriting by graph rewriting
- Algebraic Methodology and Software Technology
- Modular non-deterministic semantics for T, TB, S4, S5 and more
- Interaction nets and term-rewriting systems
- On modularity in term rewriting and narrowing
- A uniform framework for term and graph rewriting applied to combined systems
- Modularity of termination in term graph rewriting
This page was built for publication: Modularity in noncopying term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673186)
