[Haskell-cafe] Re: bytestring vs polymorphic contiguous lists

[Bulat Ziganshin]

Hello Duncan,

Thursday, March 1, 2007, 1:21:49 PM, you wrote:

> We're now looking at stream fusion for lists in general and as Don says,
> there's also the NDP work which is looking at arrays of arbitrary
> element type and with complex structure.

shortly speaking, this may become the most important FP research of
2000's just like monads for imperative programming became most
influential paper of 90's


-- 
Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com