Syntactical analysis of total termination

DOI10.1007/3-540-58431-5_15MaRDI QIDQ4537515zbMATH OpenFDO

Authors Maria C. F. Ferreira, Hans Zantema

Publication date 1 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/en/publications/d090f149-a46e-4d2a-8bb4-bf01666554a9

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Total termination of term rewriting
• Total termination of term rewriting
• scientific article; zbMATH DE number 3930339
• Total termination of term rewriting is undecidable
• scientific article; zbMATH DE number 408817

Cited in

(15)

• Simple termination of rewrite systems
• Modular termination proofs for rewriting using dependency pairs
• Proof-theoretic analysis of termination proofs
• Total termination of term rewriting
• Termination of term rewriting using dependency pairs
• Local termination: theory and practice
• Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
• scientific article; zbMATH DE number 3930339 (Why is no real title available?)
• On a duality between Kruskal and Dershowitz theorems
• New directions for syntactic termination orderings
• scientific article; zbMATH DE number 1179979 (Why is no real title available?)
• Total termination of term rewriting
• Termination by absence of infinite chains of dependency pairs
• Syntax-guided termination analysis
• Wanda -- a higher-order termination tool (system description)

This page was built for publication: Syntactical analysis of total termination

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