[Haskell-cafe] coding a queue with reactive

sam.roberts.1983 at gmail.com sam.roberts.1983 at gmail.com
Sun Feb 13 13:52:32 CET 2011

On , Ryan Ingram <ryani.spam at gmail.com> wrote:
> Hi Sam. I don't know much about the performance problems you are
> seeing, but I think your solution is more cleanly implemented just
> under the event level with futures.

> I think the reactive function you want has a type like this:

> stateMachine :: s -> (a -> s -> s) -> (s -> Future (b, s)) -> Event a ->  
> Event b

Hi Ryan.

I will have to study futures, and your code, for a while before I can give  
an intelligent response,
but I really appreciate the suggestion. I will have a look at futures next.

Many thanks,
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20110213/571e524a/attachment.htm>

More information about the Haskell-Cafe mailing list