Re:Introduction to Reactive Programming
by seanmcdirmid on Sunday November 02, 2014 @07:29PM
(#8548763)
Do you have an citations about AFRP implementations being incremental. I haven't been able to find much in my own literature survey.
Perhaps I'm not understanding the terminology, but every implementation I've ever seen consumes input incrementally. E.g.
data (i ~> o) = A (i -> (o, i ~> o))
data (i ~> o) = forall s. A (i -> s -> (o, s))
in each case, the inputs are consumed sequentially, the outputs returned immediately, and the local state updated for the next time around.If you're referring to the ability for a new event to update the signal network only partially (in Elliott's terminology, "push" semantics) then there's Amsden's TimeFlies library.
AFRP is a good example here. AFRP semantics are easily stated in a recomputational way. It makes it necessary to talk about causal AFRP and bounded history AFRP which are nice terms to think about a computation (if sort of obvious). Then, the efficient implementations (of causal AFRP) themselves are incremental for efficiency.