Modularity in term rewriting revisited
type: Item
instance of: scholarly article
title: Modularity in term rewriting revisited
zbMATH Open document ID: 1253.68196
author: Bernhard Gramlich
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6122463
zbMATH Keywords: term rewriting
zbMATH Keywords: termination
zbMATH Keywords: confluence
zbMATH Keywords: modularity
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.09.008
OpenAlex ID: W1966909677
cites work: Q4413064
cites work: Q4520528
cites work: A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
cites work: Q5389133
cites work: Q3783521
cites work: Q4799892
cites work: Innocuous constructor-sharing combinations
cites work: Q4692463
cites work: Q2769431
cites work: Layer systems for proving confluence
cites work: Sufficient conditions for modular termination of conditional term rewriting systems
cites work: Generalized sufficient conditions for modular termination of rewriting
cites work: Q4846997
cites work: On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
cites work: On proving termination by innermost termination
cites work: Recent trends in algebraic development techniques. 12th international workshop, WADT '97, Tarquinia, Italy, June 3--7, 1997. Selected papers
cites work: Modular Church-Rosser Modulo
cites work: Modularity of confluence: A simplified proof
cites work: Q4268467
cites work: Q4490728
cites work: Modular proofs for completeness of hierarchical term rewriting systems
cites work: Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
cites work: Modularity of termination in term graph rewriting
cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
cites work: Modular term rewriting systems and the termination
cites work: Modularity in noncopying term rewriting
cites work: Q4259966
cites work: Context-sensitive rewriting strategies
cites work: Lazy rewriting and context-sensitive rewriting
cites work: Compositional term rewriting: An algebraic proof of Toyama's theorem
cites work: Modularity of completeness revisited
cites work: On the modularity of normal forms in rewriting
cites work: The theory of vaccines
cites work: Modular aspects of properties of term rewriting systems related to normal forms
cites work: Q3204048
cites work: Modular properties of conditional term rewriting systems
cites work: Completeness of combinations of conditional constructor systems
cites work: Simple termination of rewrite systems
cites work: Decidability for left-linear growing term rewriting systems.
cites work: Combinations of simplifying conditional term rewriting systems
cites work: Modular properties of composable term rewriting systems
cites work: Q4954455
cites work: On the modularity of termination of term rewriting systems
cites work: Termination is not modular for confluent variable-preserving term rewriting systems
cites work: Q2783416
cites work: Hierarchical termination revisited.
cites work: Implementing term rewriting by graph reduction: Termination of combined systems
cites work: Collapsed tree rewriting: Completeness, confluence, and modularity
cites work: Operational and Semantic Equivalence Between Recursive Programs
cites work: On termination of the direct sum of term-rewriting systems
cites work: Termination of lazy rewriting revisited
cites work: Unification in a combination of arbitrary disjoint equational theories
cites work: Modular termination of \(r\)-consistent and left-linear term rewriting systems
cites work: Rewriting Techniques and Applications
cites work: On modularity in infinitary term rewriting
cites work: Signature Extensions Preserve Termination
cites work: Counterexamples to termination for the direct sum of term rewriting systems
cites work: On the Church-Rosser property for the direct sum of term rewriting systems
cites work: Q3830525
cites work: Term Rewriting and Applications
cites work: Termination for direct sums of left-linear complete term rewriting systems
cites work: Confluence by decreasing diagrams
cites work: Random Descent
cites work: Confluence by Decreasing Diagrams

Modularity in term rewriting revisited (cites work)
cites work: Modularity of Confluence

Modularity in term rewriting revisited (cites work)
cites work: Modular Complexity Analysis via Relative Complexity

Modularity in term rewriting revisited (cites work)
cites work: Termination of term rewriting: Interpretation and type elimination

Modularity in term rewriting revisited (DOI)
DOI: 10.1016/J.TCS.2012.09.008