1. 9

  2. 1


    Lately I’m viewing incremental computation as a critical phenomena/tool.

    However, I suspect names aren’t enough and one would a way to make sure the actual algorithms used are incremental. The paradox is that in some algorithms, recomputation/full-scan is unavoidable and for some it is easily avoided but determining which is which is beyond existing compilers. The solution I’d see is a way to make the incremental part of a computation easy, especially a language to express nearly everything in terms of tree.