Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs

Résumé

Quasi-interpretations have shown their interest to deal with resource analysis of first order functional programs. There are at least two reasons to study the question of modularity of quasi-interpretations. Firstly, modularity allows to decrease the complexity of the quasi-inter\-pretation search algorithms. Secondly, modularity allows to increase the intentionality of the quasi-interpretation method, that is the number of captured programs. In particular, we take advantage of modularity conditions to extend smoothly quasi-interpretations to higher order programs. In this paper, we study the modularity of quasi-interpretations through the notions of constructor-sharing and hierarchical unions. We show that in the case of constructor-sharing and hierarchical unions, the existence of quasi-interpretations is no longer a modular property. However, we can still certify the complexity of programs.
Fichier principal
Vignette du fichier
modu.pdf (268.06 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00130920 , version 1 (14-02-2007)

Identifiants

  • HAL Id : inria-00130920 , version 1

Citer

Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux. Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs. ICTAC, Sep 2007, Macao, China. ⟨inria-00130920⟩
248 Consultations
81 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More