On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
From MaRDI portal
Publication:671506
DOI10.1016/0304-3975(96)00042-4zbMATH Open0872.68081OpenAlexW2024508150MaRDI QIDQ671506FDOQ671506
Authors: Bernhard Gramlich 
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
Recommendations
- Confluence of terminating conditional rewrite systems revisited
- scientific article; zbMATH DE number 1761895
- Confluence of the disjoint union of conditional term rewriting systems
- scientific article; zbMATH DE number 1456966
- Conditions for confluence of innermost terminating term rewriting systems
- scientific article; zbMATH DE number 794237
- Some results on the confluence property of combined term rewriting systems
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- scientific article; zbMATH DE number 1615229
- scientific article; zbMATH DE number 4092756
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional rewrite rules
- Conditional rewrite rules: Confluence and termination
- Modular properties of composable term rewriting systems
- Title not available (Why is that?)
- Modular properties of conditional term rewriting systems
- Tree-Manipulating Systems and Church-Rosser Theorems
- Title not available (Why is that?)
- Counterexamples to termination for the direct sum of term rewriting systems
- Computing in systems described by equations
- On the Church-Rosser property for the direct sum of term rewriting systems
- Title not available (Why is that?)
- Termination for direct sums of left-linear complete term rewriting systems
- Sufficient conditions for modular termination of conditional term rewriting systems
- On termination of the direct sum of term-rewriting systems
- 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
- Completeness of combinations of constructor systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Modularity in term rewriting revisited
- Modularity of simple termination of term rewriting systems with shared constructors
- Completeness of combinations of conditional constructor systems
- Generalized sufficient conditions for modular termination of rewriting
- On the modularity of termination of term rewriting systems
- Proving weak properties of rewriting
- On the confluence of lambda-calculus with conditional rewriting
- Decreasing diagrams and relative termination
- Decreasing diagrams and relative termination
- Perpetual reductions in \(\lambda\)-calculus
- On the longest perpetual reductions in orthogonal expression reduction systems
- Unions of non-disjoint theories and combinations of satisfiability procedures
- On proving termination by innermost termination
- Confluence of terminating conditional rewrite systems revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mechanizing and improving dependency pairs
- Confluence of the disjoint union of conditional term rewriting systems
- A uniform framework for term and graph rewriting applied to combined systems
This page was built for publication: On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671506)
