graph reduction

G g

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definition of graph reduction words

noun Technical meaning of graph reduction A 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). In contrast to string reduction, graph reduction has the advantage that common subexpressions are represented as pointers to a single instance of the expression which is only reduced once. It is the most commonly used technique for implementing lazy evaluation. 1

Just one definition for graph reduction

Information block about the term

Parts of speech for Graph reduction

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Graph reduction

See also

All definitions of graph reduction

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?