Graph reduction underlies most implementations of lazy functional languages, allowing separate computations to share results when sub-terms are evaluated. Once a term is evaluated, the node of the graph representing the computation is updated with the value of the term. However , in many cases, no other computation requires this value, so the update is unnecessary. In this paper we take some st...
