Incremental reduction in the lambda calculus

John Field, Tim Teitelbaum · 1990

An incremental algorithm is one that takes advantage of the fact that the function it computes is to be evaluated repeatedly on inputs that differ only slightly from one another, avoiding unnecessary duplication of common computations.

Read the paper · More papers on PaperTik