Any idea how Elerea compares to Grapefruit? It's great to see a lot of competition in the FRP arena, but I hope in the end this results in a really usable and scalable FRP system for Haskell :-)


2009/4/11 Patai Gergely <patai_gergely@fastmail.fm>
> An other interesting approach to FRP is frtime (in Scheme):
> http://www.cs.brown.edu/~sk/Publications/Papers/Published/ck-frtime/
> There should be a second paper than this one, I have just forget its
> reference.
Elerea is a bit similar, since it also maintains the connections between
signals explicitly. However, its evaluation is a backward chaining
process starting from the top-level signal, only affecting the nodes it
depends on transitively. Only stateful signals need to be mutated and
reevaluated whenever the top level is sampled (to avoid time and space
leaks). Constants, pure functions and function application nodes always
stay the same, and they are lazily evaluated. Peripheral bound external
signals are also static from the point of view of the evaluator, and it
is the responsibility of the environment to update them.

Gergely

--
http://www.fastmail.fm - Accessible with your email software
                         or over the web

_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe