Modularity in term rewriting revisited
From MaRDI portal
Publication:1929227
DOI10.1016/j.tcs.2012.09.008zbMath1253.68196OpenAlexW1966909677MaRDI QIDQ1929227
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.008
Related Items (4)
Variants and satisfiability in the infinitary unification wonderland ⋮ Unnamed Item ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Modular termination of prefix-constrained term rewrite systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unification in a combination of arbitrary disjoint equational theories
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Modular termination of \(r\)-consistent and left-linear term rewriting systems
- Modularity in noncopying term rewriting
- Termination is not modular for confluent variable-preserving term rewriting systems
- On the modularity of normal forms in rewriting
- Modular properties of conditional term rewriting systems
- Modular term rewriting systems and the termination
- Counterexamples to termination for the direct sum of term rewriting systems
- On termination of the direct sum of term-rewriting systems
- Modularity of confluence: A simplified proof
- Confluence by decreasing diagrams
- Generalized sufficient conditions for modular termination of rewriting
- Completeness of combinations of conditional constructor systems
- Termination of term rewriting: Interpretation and type elimination
- On the modularity of termination of term rewriting systems
- Modular proofs for completeness of hierarchical term rewriting systems
- Recent trends in algebraic development techniques. 12th international workshop, WADT '97, Tarquinia, Italy, June 3--7, 1997. Selected papers
- Simple termination of rewrite systems
- Decidability for left-linear growing term rewriting systems.
- Hierarchical termination revisited.
- Context-sensitive rewriting strategies
- Modular properties of composable term rewriting systems
- On modularity in infinitary term rewriting
- Lazy Rewriting and Context-Sensitive Rewriting
- Termination of Lazy Rewriting Revisited
- A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
- Confluence by Decreasing Diagrams
- Modular Church-Rosser Modulo
- Modularity of Confluence
- Signature Extensions Preserve Termination
- Operational and Semantic Equivalence Between Recursive Programs
- Termination for direct sums of left-linear complete term rewriting systems
- The theory of vaccines
- Innocuous constructor-sharing combinations
- Modular aspects of properties of term rewriting systems related to normal forms
- Modularity of completeness revisited
- On proving termination by innermost termination
- Modularity of termination in term graph rewriting
- Compositional term rewriting: An algebraic proof of Toyama's theorem
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- Modular Complexity Analysis via Relative Complexity
- Random Descent
- On the Church-Rosser property for the direct sum of term rewriting systems
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Term Rewriting and Applications
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Combinations of simplifying conditional term rewriting systems
- Sufficient conditions for modular termination of conditional term rewriting systems
- Implementing term rewriting by graph reduction: Termination of combined systems
- Rewriting Techniques and Applications
This page was built for publication: Modularity in term rewriting revisited
