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

Martin Avanzini 1, 2 Ugo Dal Lago 2, 1 Georg Moser 3
1 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : 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 the result to existing tools for the complexity analysis of first-order term rewrite systems. This is done while carefully analysing complexity preservation and reflection of the employed transformations such that the complexity of the obtained term rewrite system reflects on the complexity of the initial program. Further, we describe suitable strategies for the application of the studied transformations and provide ample experimental data for assessing the viability of our method.
Document type :
Conference papers
Complete list of metadatas

Cited literature [51 references]  Display  Hide  Download

https://hal.inria.fr/hal-01231809
Contributor : Ugo Dal Lago <>
Submitted on : Friday, November 20, 2015 - 5:02:57 PM
Last modification on : Tuesday, April 16, 2019 - 3:08:04 PM
Long-term archiving on : Friday, April 28, 2017 - 9:20:43 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Martin Avanzini, Ugo Dal Lago, Georg Moser. Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order. ICFP 2015, Aug 2015, Vancouver, Canada. ⟨10.1145/2784731.2784753⟩. ⟨hal-01231809⟩

Share

Metrics

Record views

235

Files downloads

237