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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073070
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:44:20 AM
Last modification on : Saturday, February 9, 2019 - 1:23:02 AM
Long-term archiving on: Sunday, April 4, 2010 - 11:33:18 PM

Identifiers

  • HAL Id : inria-00073070, version 1

Citation

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

Share

Metrics

Record views

386

Files downloads

242