Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

FUIN
2006

favoriteEmaildiscussreport

85views more FUIN 2006»

Higher Order Deforestation

13 years 4 months ago

Higher Order Deforestation

Download www2.in.tum.de

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.

Geoff W. Hamilton

Real-time Traffic

Deforestation | FUIN 2006 | Functional Programs | Intermediate Data Structures |

claim paper

Related Content

» Positive supercompilation for a higher order callbyvalue language

» Harnessing First Order Termination Provers Using Higher Order Dependency Pairs

» Efficiently Simulating HigherOrder Arithmetic by a FirstOrder Theory Modulo

» An Empirical Comparison of Inference Algorithms for Graphical Models with Higher Order Fac...

» Retrieval of higher order ocean wave spectra from sunglint

» Each averaging technique yields reliable a posteriori error control in FEM on unstructured...

» A Theorem on Higher Bruhat Orders

» Improved Total VariationType Regularization Using Higher Order Edge Detectors

» Kusuoka representation of higher order dual risk measures

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	FUIN
Authors	Geoff W. Hamilton

Comments (0)