Natural termination

DOI10.1016/0304-3975(94)00275-4MaRDI QIDQ673622zbMATH OpenOpenAlexFDO

Authors Nachum Dershowitz, Charles Hoot

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00275-4

zbMATH Keywords

termination of rewrite systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 3930339
• Topics in termination
• Termination of term rewriting: Interpretation and type elimination
• Termination of rewriting

Cites work

• scientific article; zbMATH DE number 4090846 (Why is no real title available?)
• scientific article; zbMATH DE number 3729436 (Why is no real title available?)
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3635501 (Why is no real title available?)
• scientific article; zbMATH DE number 1324443 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 794239 (Why is no real title available?)
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• A geometrical approach to multiset orderings
• An improved general path order
• Computing in systems described by equations
• Equational inference, canonical proofs, and proof orderings
• On the recursive decomposition ordering with lexicographical status and other related orderings
• On theories with a combinatorial definition of 'equivalence'
• Orderings for term-rewriting systems
• Polynomial time termination and constraint satisfaction tests
• Proving Properties of Programs by Structural Induction
• Proving termination with multiset orderings
• Termination of rewriting
• Termination of rewriting systems by polynomial interpretations and its implementation
• Topics in termination

Cited in

(15)

• Non-Looping String Rewriting
• Mobile Processes and Termination
• An improved general path order
• Modular termination proofs for rewriting using dependency pairs
• Termination of term rewriting using dependency pairs
• Jumping and escaping: modular termination and the abstract path ordering
• Termination of constructor systems
• Ensuring termination by typability
• On proving termination by innermost termination
• Outermost ground termination
• Overlap closures do not suffice for termination of general term rewriting systems
• Weighted Path Orders Are Semantic Path Orders
• Natural Rewriting for General Term Rewriting Systems
• Topics in termination
• TERMINATION OF ABSTRACT REDUCTION SYSTEMS

Describes a project that uses

Uses Software

• REVE

This page was built for publication: Natural termination

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