Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

If you like this kind of thing, google Self-Adjusting Computation.

One advantage of self-adjusting computation vs. the differential dataflow approach is you can convert existing imperative code to it very easily. For example, a ray tracer with self-adjusting computation is written very similarly to a ray tracer without it.

There's a C++ library that implements parallel-friendly self-adjusting computation here: https://github.com/cmuparlay/psac

I see no reason why a Rust version couldn't be implemented.



Is "Self-Adjusting Computation" the Computer Science term for fine-grained automatic "reactive" subscription tracking like Mobx & Starbeam?

Is it the same idea as presented here? https://github-com.translate.goog/nin-jin/slides/blob/master...


I'm not familiar with that approach, but it appears to be in the same design space (but not the same design). I'd examine both if you have time.


Self adjusting computation is such a great framework.




Consider applying for YC's Fall 2026 batch! Applications are open till July 27.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: