We compare transformations for the elimination of intermediate results in rst-order functional programs. We choose the well known deforestation technique of Wadler and composition techniques from the theory of tree transducers, of which the implementation of functional programs yet does not take advantage. We identify syntactic classes of function de nitions for which both techniques deliver equally ecient results and for which one technique is more powerful than the other
Projet OSCARThe deforestation of a functional program is a transformation which gets rid ofintermedi...
Software engineering has to reconcile modularity with efficiency. One way to grapple with this dilem...
Deforestation optimises a functional program by transforming it into another one that does not creat...
In lazy functional programs a data structure is often used to combine two separate parts of the prog...
ii In lazy functional programming modularity is often achieved by using intermediate data structures...
Functional programming languages are an ideal medium for program optimisations based on source-to-s...
In functional languages intermediate data structures are often used as glue to connect separate part...
We present a technique to prevent the construction of intermediate data structures in functional pro...
In functional programming, intermediate data structures are often used to “glue’) together small pro...
AbstractWadler's deforestation algorithm eliminates intermediate data structures from functional pro...
AbstractAn algorithm that transforms programs to eliminate intermediate trees is presented. The algo...
Abstract. Deforestation optimises a functional program by transform-ing it into another one that doe...
Wadler’s deforestation algorithm eliminates intermediate data structures from functional pro-grams. ...
Deforestation optimises a functional program by transforming it into another one that does not creat...
In functional languages intermediate data structures are often used as glue to connect separate par...
Projet OSCARThe deforestation of a functional program is a transformation which gets rid ofintermedi...
Software engineering has to reconcile modularity with efficiency. One way to grapple with this dilem...
Deforestation optimises a functional program by transforming it into another one that does not creat...
In lazy functional programs a data structure is often used to combine two separate parts of the prog...
ii In lazy functional programming modularity is often achieved by using intermediate data structures...
Functional programming languages are an ideal medium for program optimisations based on source-to-s...
In functional languages intermediate data structures are often used as glue to connect separate part...
We present a technique to prevent the construction of intermediate data structures in functional pro...
In functional programming, intermediate data structures are often used to “glue’) together small pro...
AbstractWadler's deforestation algorithm eliminates intermediate data structures from functional pro...
AbstractAn algorithm that transforms programs to eliminate intermediate trees is presented. The algo...
Abstract. Deforestation optimises a functional program by transform-ing it into another one that doe...
Wadler’s deforestation algorithm eliminates intermediate data structures from functional pro-grams. ...
Deforestation optimises a functional program by transforming it into another one that does not creat...
In functional languages intermediate data structures are often used as glue to connect separate par...
Projet OSCARThe deforestation of a functional program is a transformation which gets rid ofintermedi...
Software engineering has to reconcile modularity with efficiency. One way to grapple with this dilem...
Deforestation optimises a functional program by transforming it into another one that does not creat...