(→Abstract: added purely functional aspect, in contrast with DataDriven)
Revision as of 19:04, 10 December 2007
Reactive is a simple foundation for programming reactive systems functionally. Like Fran/FRP, it has a notions of (reactive) behaviors and events. Like DataDriven, Reactive has a data-driven implementation. The main difference between Reactive and DataDriven are
- Reactive builds on STM-based IVars, while DataDriven builds on continuation-based computations; and
- The algebra of events and reactive values (called events and sources in DataDriven) are purely functional. I couldn't figure out how to accomplish that in DataDriven.
- Reactive manages (I hope) to get the efficiency of data-driven computation with a (sort-of) demand-driven architecture. For that reason, Reactive is garbage-collector-friendly, while DataDriven depends on weak references (because GC favors demand-driven computation.)
As with DataDriven, Reactive provides instances for Monoid, Functor, Applicative, and Monad.
Besides this wiki page, here are more ways to find out about Reactive:
- Read the Haddock docs.
- Get the code repository: darcs get http://darcs.haskell.org/packages/reactive.
- Install from Hackage (coming).
- See the version history.
Please leave comments at the Talk page.