Deforestation (computer science)

Subclass of	program transformation
Named by	Philip Wadler

Insyd de theory of programming languages for computer science, deforestation (dem sanso dey bell am fusion) be some program transformation to chop out some intermediate lists anaa tree structures wey dem create then immediately program consume am.

Na de term "deforestation" be originally created by Philip Wadler for ein 1990 paper top "Deforestation: transforming programs to eliminate trees".^[1]

Deforestation be typically used for programs insyd functional programming languages, particularly non-strict programming languages such as Haskell. One particular algorithm for deforestation,^[2] shortcut deforestation, dem implemente am for de Glasgow Haskell Compiler.^[3] Deforestation dey closely relate to escape analysis.

References

↑ 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" (PDF). Proc. Conf. on Functional Programming Languages and Computer Architecture. pp. 223–232. doi:10.1145/165180.165214.
↑ Peyton Jones, Simon; Andrew Tolmach; C.A.R. Hoare (2001). "Playing by the rules: rewriting as a practical optimization technique in GHC" (PDF). Proc. ACM/SIGPLAN Haskell Workshop.

Sanso spy

Hylomorphism (computer science)

[1] Wadler, Philip (1990). "Deforestation: transforming programs to eliminate trees". Theoretical Computer Science. 73 (2): 231–248. doi:10.1016/0304-3975(90)90147-A.

[2] Gill, Andrew; John Launchbury; Simon Peyton Jones (1993). "A short cut to deforestation" (PDF). Proc. Conf. on Functional Programming Languages and Computer Architecture. pp. 223–232. doi:10.1145/165180.165214.

[3] Peyton Jones, Simon; Andrew Tolmach; C.A.R. Hoare (2001). "Playing by the rules: rewriting as a practical optimization technique in GHC" (PDF). Proc. ACM/SIGPLAN Haskell Workshop.

[1]

[2]

[3]