On termination of the direct sum of term-rewriting systems
From MaRDI portal
Publication:1108785
DOI10.1016/0020-0190(87)90039-1zbMath0654.68030OpenAlexW2017284475MaRDI QIDQ1108785
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00075874/file/RR-0679.pdf
Related Items (34)
Decidability of reachability for disjoint union of term rewriting systems ⋮ Combinations of simplifying conditional term rewriting systems ⋮ Sufficient conditions for modular termination of conditional term rewriting systems ⋮ Type removal in term rewriting ⋮ 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 ⋮ Modular aspects of properties of term rewriting systems related to normal forms ⋮ Termination for the direct sum of left-linear term rewriting systems ⋮ Adding algebraic rewriting to the untyped lambda calculus (extended abstract) ⋮ 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 ⋮ Interaction nets and term-rewriting systems ⋮ Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems ⋮ Modular term rewriting systems and the termination ⋮ Overlap closures do not suffice for termination of general term rewriting systems ⋮ Modularity of termination and confluence in combinations of rewrite systems with λω ⋮ On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems ⋮ Intersection type assignment systems with higher-order algebraic rewriting ⋮ 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 ⋮ Modularity of simple termination of term rewriting systems with shared constructors ⋮ Adding algebraic rewriting to the untyped lambda calculus ⋮ Completeness of combinations of constructor systems ⋮ Modular termination of prefix-constrained term rewrite systems ⋮ A uniform framework for term and graph rewriting applied to combined systems ⋮ The conflict-free reduction geometry ⋮ Modular and incremental automated termination proofs ⋮ Modular termination proofs for rewriting using dependency pairs
Cites Work
This page was built for publication: On termination of the direct sum of term-rewriting systems
