Differential Dataflow solves the second hardest problem in computer science - caching - by calculating the optimal reactions to an event that will maintain the

Differential Dataflow solves the second hardest problem in computer science - caching - by calculating the optimal reactions to an event that will maintain the client's view. Of course, this requires tracking client queries and state cursors. For more background, look at Adapton and Jane Street's incremental DOM implementations: https://github.com/janestreet/incr_dom https://github.com/janestreet/incr_dom