Perhaps I'm not understanding the terminology, but every implementation I've ever seen consumes input incrementally. E.g. data (i ~> o) = A (i ->

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.