Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

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

Résumé

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.
Fichier principal
Vignette du fichier
paper.pdf (403.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01231809 , version 1 (20-11-2015)

Identifiants

Citer

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⟩
118 Consultations
242 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More