Analysing the complexity of functional programs: Higher-order meets first-order (long version)

M Avanzini, UD Lago, G Moser - arXiv preprint arXiv:1506.05043, 2015 - arxiv.org
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalized versions of them …
被引用次数：4 相关文章
[PDF] researchgate.net

[PDF][PDF] Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version)

M Avanzini, U Dal Lago, G Moser - arXiv preprint arXiv …, 2015 - researchgate.net
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalized versions of them …

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version)

M Avanzini, U Dal Lago, G Moser - arXiv e-prints, 2015 - ui.adsabs.harvard.edu
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalized versions of them …