Abstract / Description of output
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 optimizing compiler
Original language | English |
---|---|
Pages (from-to) | 231-248 |
Number of pages | 18 |
Journal | Theoretical Computer Science |
Volume | 73 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Jan 1988 |