Modular termination of prefix-constrained term rewrite systems

DOI10.1016/J.IPL.2021.106207OpenAlexW3200853050MaRDI QIDQ2059889

Nirina Andrianarivelo, Pierre Réty

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106207

zbMATH Keywords

formal methodsprefix-constrained rewritingmodularity of termination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Counterexamples to termination for the direct sum of term rewriting systems
• On termination of the direct sum of term-rewriting systems
• Generalized sufficient conditions for modular termination of rewriting
• On the modularity of termination of term rewriting systems
• Context-sensitive rewriting strategies
• Modularity in term rewriting revisited
• Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies
• Termination for direct sums of left-linear complete term rewriting systems

This page was built for publication: Modular termination of prefix-constrained term rewrite systems