Modular term rewriting systems and the termination
From MaRDI portal
Publication:910207
DOI10.1016/0020-0190(90)90221-IzbMath0695.68028OpenAlexW2118530352MaRDI QIDQ910207
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90221-i
Related Items
Confluence of the disjoint union of conditional term rewriting systems ⋮ Generalized sufficient conditions for modular termination of rewriting ⋮ Modular proofs for completeness of hierarchical term rewriting systems ⋮ Modularity in term rewriting revisited ⋮ Modularity of simple termination of term rewriting systems with shared constructors ⋮ On modularity in infinitary term rewriting ⋮ Completeness of combinations of constructor systems
Cites Work
- Unnamed Item
- Unnamed Item
- Termination of rewriting
- Counterexamples to termination for the direct sum of term rewriting systems
- On termination of the direct sum of term-rewriting systems
- Simplification by Cooperating Decision Procedures
- 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