4 citations · 12 across the 11 of their papers we have counts for
Showing 2011 · cs.LOShow all
2 papers · 2 filters
cs.LO2011★ 4 cited
Uncurrying for Innermost Termination and Derivational Complexity
Harald Zankl, Nao Hirokawa, Aart Middeldorp
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is te…
cs.LO2011
Automated Complexity Analysis Based on the Dependency Pair Method
Nao Hirokawa, Georg Moser
This article is concerned with automated complexity analysis of term rewrite systems. Since these systems underlie much of declarative programming, time complexity of functions def…