scientific article
From MaRDI portal
Publication:3204048
zbMath0716.68054MaRDI QIDQ3204048
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Decidability of reachability for disjoint union of term rewriting systems ⋮ Sufficient conditions for modular termination of conditional term rewriting systems ⋮ Confluence of the disjoint union of conditional term rewriting systems ⋮ Implementing term rewriting by graph reduction: Termination of combined systems ⋮ Generalized sufficient conditions for modular termination of rewriting ⋮ Termination for the direct sum of left-linear term rewriting systems ⋮ On the modularity of termination of term rewriting systems ⋮ Modular proofs for completeness of hierarchical term rewriting systems ⋮ The theory of vaccines ⋮ Bubbles in modularity ⋮ Modularity in term rewriting revisited ⋮ Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems ⋮ Modular term rewriting systems and the termination ⋮ On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems ⋮ Modular termination of \(r\)-consistent and left-linear term rewriting systems ⋮ Completeness of combinations of conditional constructor systems ⋮ Modularity in noncopying term rewriting ⋮ Extension orderings ⋮ Transforming termination by self-labelling ⋮ Modularity of simple termination of term rewriting systems with shared constructors ⋮ Completeness of combinations of constructor systems ⋮ Modular termination of prefix-constrained term rewrite systems