scientific article; zbMATH DE number 4035120

MaRDI QIDQ3774933zbMATH OpenFDO

Authors Paul Walton jun. Purdom

Publication date 1987

zbMATH Keywords

Knuth-Bendixloopingrewrite rulesrewrite systemsimplificationstree matchingunification algorithms

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• Loop detection in term rewriting using the eliminating unfoldings
• Simple termination is difficult
• Non-Looping String Rewriting
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
• scientific article; zbMATH DE number 4016226

Cited in

(9)

• Corrigendum to ``Termination of rewriting
• Simple termination is difficult
• Fast algorithms for uniform semi-unification
• Loop Summarization and Termination Analysis
• scientific article; zbMATH DE number 4123321 (Why is no real title available?)
• scientific article; zbMATH DE number 517070 (Why is no real title available?)
• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
• Semi-unification
• Loop detection in term rewriting using the eliminating unfoldings

This page was built for publication:

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