elerea: A minimalistic FRP library
Elerea (Eventless reactivity) is a tiny continuous-time FRP implementation without the notion of event-based switching and sampling, with first-class signals (time-varying values). Reactivity is provided through various higher-order constructs that also allow the user to work with arbitrary time-varying structures containing live signals.
Stateful signals can be safely generated at any time through a specialised monad, while stateless combinators can be used in a purely applicative style. Elerea signals can be defined recursively, and external input is trivial to attach. A unique feature of the library is that cyclic dependencies are detected on the fly and resolved by inserting delays dynamically, unless the user does it explicitly.
This is a minimal library that defines only some basic primitives,
and you are advised to install
elerea-examples as well to get an
idea how to build non-trivial systems with it. The examples are
separated in order to minimise the dependencies of the core library.
|Versions [faq]||0.1.0, 0.2.0, 0.3.0, 0.4.0, 0.5.0, 0.6.0, 1.0.0, 1.1.0, 1.2.0, 1.2.1, 1.2.2, 1.2.3, 2.0.0, 2.1.0, 2.2.0, 2.3.0, 2.4.0, 2.5.0, 2.6.0, 2.7.0, 188.8.131.52, 184.108.40.206, 2.8.0, 2.9.0|
|Dependencies||base (>=3 && <5), containers [details]|
|Copyright||(c) 2009, Patai Gergely|
|Maintainer||Patai Gergely (email@example.com)|
|Uploaded||by GergelyPatai at 2009-07-26T19:53:57Z|
|Distributions||LTSHaskell:2.9.0, NixOS:2.9.0, Stackage:2.9.0|
|Downloads||20741 total (65 in the last 30 days)|
|Rating||2.0 (votes: 1) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees