Termination is not modular for confluent variable-preserving term rewriting systems

DOI10.1016/0020-0190(94)00187-4MaRDI QIDQ674186zbMATH OpenOpenAlexFDO

Authors Enno Ohlebusch

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/0020-0190(94)00187-4

zbMATH Keywords

modularityprogram specificationterm rewritingtermination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites work

• Counterexamples to termination for the direct sum of term rewriting systems
• Generalized sufficient conditions for modular termination of rewriting
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 194506 (Why is no real title available?)
• scientific article; zbMATH DE number 1456966 (Why is no real title available?)
• Modular properties of conditional term rewriting systems
• On the Church-Rosser property for the direct sum of term rewriting systems
• Termination for direct sums of left-linear complete term rewriting systems

Cited in

(2)

• On the modularity of termination of term rewriting systems
• Modularity in term rewriting revisited

This page was built for publication: Termination is not modular for confluent variable-preserving term rewriting systems

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