Higher Order Deforestation

Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all programs. Several techniques to ensure termination of deforestation on all rst-order programs are known, but a technique for higher-order programs was only recently introduced by Hamilton, and elaborated and implemented in the Glasgow Haskell compiler by Marlow. We introduce a new technique for ensuring termination of deforestation on all higher-order programs that allows useful transformation steps prohibited in Hamilton's and Marlowe's techniques.

• Type: Journal
• Year: 2006
• Where: FUIN
• Authors: Geoff W. Hamilton
• Keywords: Deforestation, FUIN 2006, Functional Programs, Intermediate Data Structures