[Haskell-cafe] The Proliferation of List-Like Types
johan.tibell at gmail.com
Thu Feb 21 12:35:14 EST 2008
On Thu, Feb 21, 2008 at 5:51 PM, Thomas Schilling
<nominolo at googlemail.com> wrote:
> > I know of an example off-hand:
> > http://nominolo.blogspot.com/2007/05/networkhttp-bytestrings.html
> > (Of course, as I read that, I see that the lazy code is different from
> > the strict code, but I'll just ignore that for the sake of, uh,
> > argument.)
> Yes it does use different implementations, but the lazy interface has
> it's problems (leakage of handles, unclosed connections, and more).
> But what we really want is, as Duncan and Roman suggested, *one*
> standard, optimizable representation and conversions from and to it.
> This would work perfectly well with sockets.
I switched from lazy bytestrings to a left fold in my networking code
after reading what Oleg wrote about streams vs folds. No problems with
handles, etc. anymore.
More information about the Haskell-Cafe