How to Deforest in Accumulative Parameters?

Abstract : Software engineering has to reconcile modularity with efficiency. One way to grapple with this dilemma is to automatically transform a modular-speci- fied program into an efficient-implementable one. This is the aim of deforesta- tion transformations which get rid of intermediate data structures constructio- ns that appear when two functions are composed. Nevertheless, existing functional methods cannot deforest non-trivial intermediate constructions that are processed by symbolic composition. This new deforestation technique is based on the descriptional composition dedicated to attribute grammars. In this paper, we present the symbolic composition, we outline its counterpart in terms of classical deforestation methods and we sketch a way to embed it in a functional framework.
Type de document :
[Research Report] RR-3608, INRIA. 1999
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:44:20
Dernière modification le : mardi 15 janvier 2019 - 14:54:08
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:33:18



  • HAL Id : inria-00073070, version 1


Loïc Correnson, Étienne Duris, Didier Parigot, Gilles Roussel. How to Deforest in Accumulative Parameters?. [Research Report] RR-3608, INRIA. 1999. 〈inria-00073070〉



Consultations de la notice


Téléchargements de fichiers