Combinator graph reduction

From Wikipedia, the free encyclopedia

You have new messages (last change).

Combinator graph reduction is a fundamental implementation technique for functional programming languages, in which a program is converted into a combinator representation which is mapped to a directed graph data structure in computer memory, and program execution then consists of rewriting parts of this graph ("reducing" it) so as to move towards useful results.

It was invented by David Turner.

[edit] See also

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../c/o/m/Combinator_graph_reduction.html"