Termination for direct sums of left-linear complete term rewriting systems

DOI10.1145/227683.227689zbMath0885.68093OpenAlexW2122267814MaRDI QIDQ4369898

Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt

Publication date: 28 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1380

zbMATH Keywords

term rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (27)

Decidability of reachability for disjoint union of term rewriting systems ⋮ THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS ⋮ Modularity of completeness revisited ⋮ FDT is undecidable for finitely presented monoids with solvable word problems ⋮ 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 ⋮ Jumping and escaping: modular termination and the abstract path ordering ⋮ Interaction nets and term-rewriting systems ⋮ Modular term rewriting systems and the termination ⋮ Algebraic specification of concurrent systems ⋮ 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 ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ Modularity of simple termination of term rewriting systems with shared constructors ⋮ A domain model characterising strong normalisation ⋮ Lazy productivity via termination ⋮ How to normalize the Jay ⋮ Unnamed Item ⋮ TERMINATION OF ABSTRACT REDUCTION SYSTEMS ⋮ Modular termination of prefix-constrained term rewrite systems ⋮ Congruential complements of ground term rewrite systems ⋮ Modular termination proofs for rewriting using dependency pairs

This page was built for publication: Termination for direct sums of left-linear complete term rewriting systems