A Theory of Changes for Higher-Order Languages - Incrementalizing λ-Calculi by Static Differentiation · HackerPapers discussions

A Theory of Changes for Higher-Order Languages - Incrementalizing λ-Calculi by Static Differentiation — mentioned by benrbray

Fri, 07 Aug 2020 19:18:49 GMT

I think this is an area where practice has lagged quite far behind theory (for entirely reasonable practical reasons). I've seen quite a few papers relating to incremental parsing, compilation, etc. (e.g. [1,2]) but afaik very few build systems actually take advantage. [1] https://arxiv.org/abs/1312.0658 [2] https://blog.functorial.com/posts/2018-04-08-Incrementally-I...

Paper and discussion history. A mention is not an endorsement.

A Theory of Changes for Higher-Order Languages - Incrementalizing λ-Calculi by Static Differentiation — mentioned by markharper

Sun, 19 May 2019 15:15:22 GMT

That sounds similar to the incremental lambda calculus described in this paper: https://arxiv.org/abs/1312.0658 There's an implementation for DOM updates in Purescript (https://blog.functorial.com/posts/2018-04-08-Incrementally-I...), but I haven't come across a similar approach in Javascript yet.

Paper and discussion history. A mention is not an endorsement.

A Theory of Changes for Higher-Order Languages - Incrementalizing λ-Calculi by Static Differentiation — mentioned by cgrand-net

Mon, 12 Nov 2018 14:40:27 GMT

A Theory of Changes for Higher-Order Languages - Incrementalizing λ-Calculi by Static Differentiation > [...] We present a program transformation taking programs to their derivatives, which is fully static and automatic, supports first-class functions, and produces derivatives amenable to standard optimization. https://arxiv.org/abs/1312.0658

Paper and discussion history. A mention is not an endorsement.