Eliminating dummy elimination

DOI10.1007/10721959_25MaRDI QIDQ2723429zbMATH OpenFDO

Authors Jürgen Giesl, Aart Middeldorp

Publication date 5 July 2001

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

Full work available at URL https://doi.org/10.1007/10721959_25

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Dummy elimination: Making termination easier
• Dummy elimination in equational rewriting
• Argument filtering transformation
• Elimination transformations for associative-commutative rewriting systems
• Rewriting Techniques and Applications

Cited in

(9)

• Modular termination proofs for rewriting using dependency pairs
• scientific article; zbMATH DE number 5354051 (Why is no real title available?)
• Argument filtering transformation
• Dummy elimination in equational rewriting
• Dummy elimination: Making termination easier
• Termination of Narrowing in Left-Linear Constructor Systems
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Elimination transformations for associative-commutative rewriting systems
• Searching by elimination

This page was built for publication: Eliminating dummy elimination

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