Graph Reduction

**Prof. Dr. Sinsi** · 07-22-2012

* 1

graph reductiona technique invented by chris wadsworth where an expression is represented as a directed graph (usually drawn as an inverted tree)

each node represents a function call and its subtrees represent the arguments to that function

subtrees are replaced by the expansion or value of the expression they represent

this is repeated until the tree has been reduced to a value with no more function calls (a normal form)
English Related Words* adjacency graph
* applicative order reduction
* area graph
* associative graph
* bar graph
* beta reduction
* bipartite graph
* bulk reduction
* capital reduction
* codd's reduction algorithm
* cold reduction
* column graph
* complete graph
* connected graph
* credit reduction

07-22-2012	#1
Prof. Dr. Sinsi	Graph Reduction * 1graph reductiona technique invented by chris wadsworth where an expression is represented as a directed graph (usually drawn as an inverted tree) each node represents a function call and its subtrees represent the arguments to that function subtrees are replaced by the expansion or value of the expression they represent this is repeated until the tree has been reduced to a value with no more function calls (a normal form) English Related Words* adjacency graph * applicative order reduction * area graph * associative graph * bar graph * beta reduction * bipartite graph * bulk reduction * capital reduction * codd's reduction algorithm * cold reduction * column graph * complete graph * connected graph * credit reduction