Uncurrying for Termination

DOI10.1007/978-3-540-89439-1_46MaRDI QIDQ5505588zbMATH OpenOpenAlexFDO

Authors Nao Hirokawa, Aart Middeldorp, Harald Zankl

Publication date 27 January 2009

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89439-1_46

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Uncurrying for termination and complexity
• Generalized and formalized uncurrying
• A termination ordering for higher order rewrite systems
• Comparing curried and uncurried rewriting
• Term Rewriting and Applications

Cited in

(11)

• Comparing curried and uncurried rewriting
• Simplifying algebraic functional systems
• Harnessing first order termination provers using higher order dependency pairs
• Generalized and formalized uncurrying
• Uncurrying for termination and complexity
• Dependency Pairs and Polynomial Path Orders
• Argument filterings and usable rules for simply typed dependency pairs
• Higher-order unCurrying
• Termination orders for 3-polygraphs
• Summarization for termination: No return!
• Matrix interpretations for proving termination of term rewriting

This page was built for publication: Uncurrying for Termination

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