Re: [Haskell-cafe] Optimization problem

It makes good sense. Each list will of events will be evaluated lazily, so thing will appear there as they appear in the input.

Indeed, thankyou. On a closer inspection I can in fact see that although the first value, (chn,[msgs]), will never appear, one can nonetheless start reading the [msgs] of any channel, precisely because they are in order in the input. Apologies for the noise, slowly learning... Regards, Rohan