Shortcut deforestation in calculational form (1995) [89 citations — 4 self]
by Akihiko Takano, Erik Meijer
In Proc. Conference on Functional Programming Languages and Computer Architecture
http://www-sop.inria.fr/oasis/personnel/Didier.Parigot/www/fnc2/Postscript/MeT95.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Takano95shortcutdeforestation,author = {Akihiko Takano and Erik Meijer},
title = {Shortcut deforestation in calculational form},
booktitle = {In Proc. Conference on Functional Programming Languages and Computer Architecture},
year = {1995},
pages = {306--313},
publisher = {ACM Press}
}
Years of Citing Articles
Abstract:
In functional programming, intermediate data structures are often used to "glue " together small programs. Deforestation is a program transformation to remove these intermediate data structures automatically. We present a simple algorithm for deforestation based on two fusion rules for hylomorphism, an expressive recursion pattern. A generic notation for hylomorphisms is introduced, where natural transformations are explicitly factored out, and it is used to represent programs. Our method successfully eliminates intermediate data structures of any algebraic type from a much larger class of compositional functional programs than previous techniques. 1
