Incremental Computation Graphs
Summary
Incremental Computation Graphs explains how to build and invalidate computation graphs using mutable inputs and memoized computations. It introduces a runtime graph that tracks dependencies and uses a red-green walk to invalidate and recompute when inputs change, enabling fast interactive re-evaluation in systems like Yabu.