[Haskell-cafe] Laziness enhances composability: an example

[Bulat Ziganshin]

Hello Cristiano,

Thursday, July 9, 2009, 4:55:09 PM, you wrote:

the best known example is chessmate implementation in Wadler's "why
functional programming matter"

but i don't know much about Python iterators, so can't say what is
difference. may be its' only simplicity since lazy lists is looks like
and processed just as lists while generators in any other language is
separate data structure

> Hi,
> I'm wondering what a good example of why laziness enhances composability would be.

> I'm specifically looking for something that can't implemented in
> Python with iterators (at least not elegantly), but can actually be implemented in Haskell.
>   
> Thanks,

> Cristiano
>  
>   


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