On Fri, Oct 7, 2011 at 2:46 PM, Brandon Moore <brandon_m_mo...@yahoo.com> wrote: >> Margnus Carlsson did something monadic several years ago. >> >> http://dl.acm.org/citation.cfm?doid=581478.581482 >> >> Perhaps there is an implementation on Hackage or on his website. >> >> This stuff also goes by the moniker "adaptive computation". See the >> references and citations of that paper for more on this. > > Umut Acar now seems to refer to this as "self-adjusting computation", > and has some work here: > > http://umut.mpi-sws.org/self-adjusting-computation > > In particular, there seems to be a modified version of Mlton.
To tie things together a bit, Magnus Carlsson's paper was based on Umut Acar's earlier work. Note in particular that there's a lot of emphasis placed on efficiently figuring out what computation needs to be re-done (and some theory to support those efficiency claims). FRP frameworks, etc. naively re-do rather too much computation (all of it, in particularly poor cases) compared to systems specifically tailored to self-adjustment. -Jan-Willem Maessen _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe