Deforestation (computer science)
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, is implemented in the Glasgow Haskell Compiler.
- Wadler, Philip (1990). "Deforestation: transforming programs to eliminate trees". Theoretical Computer Science 73 (2): 231–248. doi:10.1016/0304-3975(90)90147-A.
- Gill, Andrew; John Launchbury, Simon Peyton Jones (1993). "A short cut to deforestation". Proc. Conf. on Functional Programming Languages and Computer Architecture. pp. 223–232.
- Peyton Jones, Simon; Andrew Tolmach, C.A.R. Hoare (2001). "Playing by the rules: rewriting as a practical optimization technique in GHC". Proc. ACM/SIGPLAN Haskell Workshop.
|This programming language–related article is a stub. You can help Wikipedia by expanding it.|