Modular termination of prefix-constrained term rewrite systems

DOI10.1016/J.IPL.2021.106207MaRDI QIDQ2059889zbMATH OpenOpenAlexFDO

Authors 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 methodsmodularity of terminationprefix-constrained rewriting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Context-sensitive rewriting strategies
• Counterexamples to termination for the direct sum of term rewriting systems
• Generalized sufficient conditions for modular termination of rewriting
• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 4180808 (Why is no real title available?)
• Modularity in term rewriting revisited
• On termination of the direct sum of term-rewriting systems
• On the modularity of termination of term rewriting systems
• Term rewriting with prefix context constraints and bottom-up strategies
• Termination for direct sums of left-linear complete term rewriting systems

Cited in

(2)

• scientific article; zbMATH DE number 7566074 (Why is no real title available?)
• Murg term rewrite systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059889)