31 citations · 38 across the 7 of their papers we have counts for
1 paper · 1 filter
N. Danner, J. Paykin, J. S. Royer
We develop a static complexity analysis for a higher-order functional language with structural list recursion. The complexity of an expression is a pair consisting of a cost and a…