|
|
|
|
|
Combinator Graph ReductionCombinator 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. See also
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|