[PDF][PDF] Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order
MAU Dal Lago, G Moser - 2015 - www-sop.inria.fr
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …
automatically by applying program transformations to a defunctionalised versions of them …
[PDF][PDF] Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order
MAU Dal Lago, G Moser - 2015 - www-sop.inria.fr
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …
automatically by applying program transformations to a defunctionalised versions of them …
[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 …
automatically by applying program transformations to a defunctionalised versions of them …