The "automatic recompilation/re-execution" thing is an idea I've been kicking around for a couple of years.  Compilers and linkers are (mostly) pure functions, and can be decomposed in to simpler pure functions.  Source code, object code, executables, sample input data, and sample output data are all time-varying values.  So a subset of Reactive could be used to automatically recompile, relink, and re-execute.  The result would be a more accurate/efficient version of 'make' without the possibility of incorrect rules.

  - Conal

On Mon, Nov 10, 2008 at 8:27 AM, Shahbaz <shahbazc@gmail.com> wrote:
In the mailing list announcement, one of the potential uses of this
library is "automatic recompilation/re-execution."  This sounds very
interesting, is there more information?  Is this at all similar to
"Living it up with a Live Programming Language"
[http://lambda-the-ultimate.org/node/2149] ?

Also, are there any tutorials that show how this library can be used
(rather than just explaining semantics)?

Thanks
_______________________________________________
Reactive mailing list
Reactive@haskell.org
http://www.haskell.org/mailman/listinfo/reactive