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.
Type de document :
Communication dans un congrès
ICFP 2015, Aug 2015, Vancouver, Canada. 2015, Proceedings of ICFP 2015. 〈10.1145/2784731.2784753〉
Liste complète des métadonnées

Littérature citée [51 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01231809
Contributeur : Ugo Dal Lago <>
Soumis le : vendredi 20 novembre 2015 - 17:02:57
Dernière modification le : mercredi 10 octobre 2018 - 10:09:26
Document(s) archivé(s) le : vendredi 28 avril 2017 - 21:20:43

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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. 2015, Proceedings of ICFP 2015. 〈10.1145/2784731.2784753〉. 〈hal-01231809〉

Partager

Métriques

Consultations de la notice

188

Téléchargements de fichiers

94