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.
noun, Mathematics. 1. the branch of mathematics dealing with linear graphs. noun the branch of mathematics dealing with the properties of linear graphs Examples Graph theory uses diagrams or graphs to study the arrangements of object and the relationships between objects.
- Graph rewriting system
An extension of a term rewriting system which uses graph reduction on terms represented by directed graphs to avoid duplication of work by sharing expressions.
1. a combining form denoting a process or form of drawing, writing, representing, recording, describing, etc., or an art or science concerned with such a process: biography; choreography; geography; orthography; photography. combining form 1. indicating a form or process of writing, representing, etc: calligraphy, photography 2. indicating an art or descriptive science: choreography, oceanography word-forming […]
[grap-nl] /ˈgræp nl/ noun 1. a device consisting essentially of one or more hooks or clamps, for grasping or holding something; grapple; grappling iron. 2. a small anchor with three or more flukes, used for grappling or dragging or for anchoring a small boat, as a skiff. /ˈɡræpnəl/ noun 1. a device with a multiple […]