27 citations · 100 across the 13 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.PL2020★ 13 cited
Denotational recurrence extraction for amortized analysis
Joseph W. Cutler, Daniel R. Licata, Norman Danner
A typical way of analyzing the time complexity of functional programs is to extract a recurrence expressing the running time of the program in terms of the size of its input, and t…
cs.PL2020★ 3 cited
Denotational semantics as a foundation for cost recurrence extraction for functional languages
Norman Danner, Daniel R. Licata
A standard informal method for analyzing the asymptotic complexity of a program is to extract a recurrence that describes its cost in terms of the size of its input, and then to co…