Deforestation (computer science): Difference between revisions
Content deleted Content added
revert anon |
See also Hylomorphism |
||
| Line 25: | Line 25: | ||
| booktitle = Proc. ACM/SIGPLAN Haskell Workshop |
| booktitle = Proc. ACM/SIGPLAN Haskell Workshop |
||
| year = 2001}}</ref> |
| year = 2001}}</ref> |
||
== See also == |
|||
* [[Hylomorphism]] |
|||
== References == |
== References == |
||
Revision as of 21:09, 21 June 2007
In the theory of programming languages in computer science, deforestation (also known as fusion) is a program transformation to eliminate tree structures.
The term "deforestation" was originally coined by Philip Wadler in his paper "Deforestation: transforming programs to eliminate trees"[1].
Deforestation is typically applied to programs in functional programming languages, particularly non-strict programming languages such as Haskell. One particular algorithm for deforestation, shortcut deforestation[2], is implemented in the Glasgow Haskell Compiler.[3]
See also
References
- ^ Wadler, Philip (1990). "Deforestation: transforming programs to eliminate trees". Theoretical Computer Science. 73: 231–248.
- ^ Gill, Andrew (1993). "A short cut to deforestation". Proc. Conf. on Functional Programming Languages and Computer Architecture. pp. 223–232.
{{cite conference}}: Unknown parameter|booktitle=ignored (|book-title=suggested) (help); Unknown parameter|coauthors=ignored (|author=suggested) (help) - ^ Peyton Jones, Simon (2001). "Playing by the rules: rewriting as a practical optimization technique in GHC". Proc. ACM/SIGPLAN Haskell Workshop.
{{cite conference}}: Unknown parameter|booktitle=ignored (|book-title=suggested) (help); Unknown parameter|coauthors=ignored (|author=suggested) (help)
 | This computer-programming-related article is a stub. You can help Wikipedia by expanding it. |