[go: nahoru, domu]
Jump to content

Deforestation (computer science)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 203.218.42.14 (talk) at 10:29, 13 November 2007 (→‎See also). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

  • [[Hylomorphism (computer sci

References

  1. ^ Wadler, Philip (1990). "Deforestation: transforming programs to eliminate trees". Theoretical Computer Science. 73: 231–248.
  2. ^ 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)
  3. ^ 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)
Stub icon

This computer-programming-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Deforestation_(computer_science)&oldid=171174821"