Posts with the tag incremental computation:

Incremental Computation (Draft of part 3)

| 1253 words | incremental computation
Why TypeScript? Maybe you wondering why did I use TypeScript for this post. As it happens I have been working in the frond-end community in the last 8 years. My interest in incremental computation started by observing the similarities between some of the work I have done inside Angular’s “change detection” algorithms, and work I have done around integrating TypeScript’s compiler in (Google’s build system)[https://bazel.build/]. UI programming Why is incremental computation naturally appearing in UIs?
 READ MORE 

Incremental Computation (Draft of part 2)

| 3098 words | incremental computation
We have been talking about general computation, but so far our language was very limited. We only used function calls, numbers, and simple variable binding. We will slowly add more language primitives and see how to still have full incrementality of the computation. Conditional statements Let’s add a single conditional statement first. function cond(b: boolean, x: number, y: number) { return b ? x * x : y * y; } What does it mean to make cond incremental?
 READ MORE 

Incremental Computation (Draft of part 1)

| 3450 words | incremental computation
Incremental computation is a way of performing computations, with the expectation of future changes in the inputs to the computiation. When those changes occur the output can be updated efficiently, at minimum faster than redoing the whole computation from scratch. This problem occurs in many programming domains - UI programming, data flow, build systems, compilers, code editors. Likely you have seen it before, but didn’t call it incremental computation. Despite its prevalence, it is rarely viewed as a common computational paradigm.
 READ MORE