On Thu, Oct 9, 2008 at 12:29, roger peppe <[EMAIL PROTECTED]> wrote: > It's useful, thanks, but not really what I was originally looking for. > Synchronous channels are generally easier to reason about (less states > to deal with).
Right, that's very true. Interaction between transactions is naturally forbidden by the I in ACId (small d because that one doesn't really apply to memory transactions), but that does not mean you can't implement bounded buffers as you said. cheers, Arnar _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
