Analysing the complexity of functional programs: higher-order meets first-order

M Avanzini, U Dal Lago, G Moser - Proceedings of the 20th ACM …, 2015 - dl.acm.org
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …
被引用次数：81 相关文章

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

M Avanzini, U Dal Lago, G Moser - ICFP 2015, 2015 - inria.hal.science
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

M Avanzini, U DAL LAGO, G Moser - Proceedings of the ACM …, 2015 - cris.unibo.it
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …
[PDF] core.ac.uk

[PDF][PDF] Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

MAU Dal Lago, G Moser - 2015 - core.ac.uk
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

M Avanzini, U Dal Lago, G Moser - ICFP 2015, 2015 - hal.science
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalized versions of them …
[PDF] archive.org

[PDF][PDF] Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

MAU Dal Lago, G Moser - 2015 - scholar.archive.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 …

Analysing the complexity of functional programs: higher-order meets first-order

M Avanzini, U Dal Lago, G Moser - ACM SIGPLAN Notices, 2015 - dl.acm.org
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …
[PDF] uibk.ac.at

[PDF][PDF] Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

MAU Dal Lago, G Moser - 2015 - cl-informatik.uibk.ac.at
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …
[PDF] uibk.ac.at

[PDF][PDF] Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

MAU Dal Lago, G Moser - 2015 - tcs-informatik.uibk.ac.at
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …
[PDF] archive.org

[PDF][PDF] Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

MAU Dal Lago, G Moser - 2015 - scholar.archive.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 …