On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
From MaRDI portal
Publication:671506
DOI10.1016/0304-3975(96)00042-4zbMath0872.68081OpenAlexW2024508150MaRDI QIDQ671506
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(96)00042-4
Related Items
On proving termination by innermost termination, Mechanizing and improving dependency pairs, Modularity in term rewriting revisited, Decreasing diagrams and relative termination, Proving weak properties of rewriting, Decreasing Diagrams and Relative Termination, On the confluence of lambda-calculus with conditional rewriting, On the longest perpetual reductions in orthogonal expression reduction systems, Perpetual reductions in \(\lambda\)-calculus, A uniform framework for term and graph rewriting applied to combined systems, Unions of non-disjoint theories and combinations of satisfiability procedures, Perpetuality and uniform normalization in orthogonal rewrite systems
Cites Work
- Modular properties of conditional term rewriting systems
- Conditional rewrite rules
- Counterexamples to termination for the direct sum of term rewriting systems
- On termination of the direct sum of term-rewriting systems
- Conditional rewrite rules: Confluence and termination
- Computing in systems described by equations
- Modularity of simple termination of term rewriting systems with shared constructors
- Modularity of confluence: A simplified proof
- Generalized sufficient conditions for modular termination of rewriting
- Completeness of combinations of conditional constructor systems
- On the modularity of termination of term rewriting systems
- Modular properties of composable term rewriting systems
- Completeness of combinations of constructor systems
- Termination for direct sums of left-linear complete term rewriting systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- Tree-Manipulating Systems and Church-Rosser Theorems
- Sufficient conditions for modular termination of conditional term rewriting systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
