Uncurrying for Termination
From MaRDI portal
Publication:5505588
DOI10.1007/978-3-540-89439-1_46zbMath1182.68094OpenAlexW2142631561MaRDI 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
Related Items (7)
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs ⋮ Generalized and Formalized Uncurrying ⋮ Uncurrying for termination and complexity ⋮ Matrix interpretations for proving termination of term rewriting ⋮ Simplifying Algebraic Functional Systems ⋮ Dependency Pairs and Polynomial Path Orders ⋮ Argument Filterings and Usable Rules for Simply Typed Dependency Pairs
This page was built for publication: Uncurrying for Termination
