Uncurrying for Termination
From MaRDI portal
Publication:5505588
DOI10.1007/978-3-540-89439-1_46zbMath1182.68094MaRDI QIDQ5505588
Nao Hirokawa, Harald Zankl, Aart Middeldorp
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
68Q42: Grammars and rewriting systems
Related Items
Uncurrying for termination and complexity, Matrix interpretations for proving termination of term rewriting, Simplifying Algebraic Functional Systems, Harnessing First Order Termination Provers Using Higher Order Dependency Pairs, Generalized and Formalized Uncurrying, Dependency Pairs and Polynomial Path Orders, Argument Filterings and Usable Rules for Simply Typed Dependency Pairs