Citation Context

...Related Work. memoization, and partial evaluation [5]. Dependence graphs track what computations must be updated upon changes to input [18, 26, 37]. Memoization (caching the result of function calls) =-=[1, 6, 25, 29, 33]-=- and partial evaluation (specializing a function with respect to some fixed input) [20, 36] can be used to achieve or enhance incremental computation. A comprehensive bibliography on incremental compu...

Citation Context

...a dependencies are tracked with modifiable references, and change propagation is efficiently implemented with dynamic dependence graphs and memoization. An early self-adjusting library, written in ML =-=[2]-=-, was also reimplemented in a monadic style in Haskell [17]. In recent work, dependence tracking has been addressed at the data structure level, instead of individual memory cells, enabling further pe...