Neat, I didn't know that the new reference implementation was in Rust. It's interesting because the Rust compiler developers are themselves writing a framework for incremental computation, inspired by Adapton, for use in the compiler itself: <a href="https://github.com/nikomatsakis/salsa" rel="nofollow">https://github.com/nikomatsakis/salsa</a> (note: WIP)
I've been aware of this kind of thing before, but never really looked into it. This is pretty interesting, and the Rust docs are pretty good at stepping through it. Rust specifically can have difficulty with cyclic data, and it seems this could help with that, though it's bypassing the lifetime analysis of the type system.<p>Two thoughts of the top of my head (I haven't yet read any of the literature):<p>1) how is/could rust's lifetime analysis be applied to these ideas productively.<p>2) I wonder if you could map some predefined _names_, or something inside the system to physical caches or hardware structures.
Somewhat related and also Rust - I’ve recently put together a crate for frp-like computation (in terms of streams and all that, but the use case is somewhat close to adapton, although simpler), for my own use but then figured I’d share it because why not - <a href="https://github.com/aldanor/reactive-rs" rel="nofollow">https://github.com/aldanor/reactive-rs</a>