Abstract
An algorithm that transforms programs to eliminate intermediate trees is presented. The algorithm applies to any term containing only functions with definitions in a given syntactic form, and is suitable for incorporation in an optimising compiler. Intermediate lists---and, more generally, intermediate trees---are both the basis and the bane of a certain style of programming in functional languages.
Deforestation.ppt.gz (Presentation (pwt) deforestation (dutch))
Deforestation.ppt.gz (Presentation of deforestation in powerpoint(dutch))
slides.ps.gz (Transformationrules deforestation algoritm (dutc )
I ![]() | Attachment ![]() | Action | Size | Date | Who | Comment |
---|---|---|---|---|---|---|
![]() | Deforestation.ppt.gz | manage | 10.1 K | 08 Jun 2001 - 12:33 | TWikiGuest | Presentation of deforestation in powerpoint(dutch) |
![]() | slides.ps.gz | manage | 14.5 K | 08 Jun 2001 - 12:35 | TWikiGuest | Transformationrules deforestation algoritm (dutc |