23 citations · 74 across the 18 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015★ 2 cited
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version)
Martin Avanzini, Ugo Dal Lago, Georg Moser
We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding…
cs.CC2015
On Sharing, Memoization, and Polynomial Time (Long Version)
Martin Avanzini, Ugo Dal Lago
We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natur…