Tim Newsham <news...@lava.net> wrote in article <pine.bsi.4.64.0906051608180.14...@malasada.lava.net> in gmane.comp.lang.haskell.cafe: > > Could it be the "amb" described at > > > > http://conal.net/blog/posts/functional-concurrency-with-unambiguous-choice/ > > http://conal.net/blog/posts/smarter-termination-for-thread-racing/ > > ? > It reminds me a little of unamb but is different.
I agree, but could it be the "amb" described there? -- Edit this signature at http://www.digitas.harvard.edu/cgi-bin/ken/sig We want our revolution, and we want it now! -- Marat/Sade We want our revolution, and we'll take it at such time as you've gotten around to delivering it -- Haskell programmer _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
