Denotational cost semantics for functional languages with inductive types

Norman Danner, Daniel R. Licata, Ramyaa Ramyaa

A central method for analyzing the asymptotic complexity of a functional program is to extract and then solve a recurrence that expresses evaluation cost in terms of input size. Th…