[Haskell-cafe] Laziness enhances composability: an example

[Jeremy Shaw]

Hello,

A wonderful, and practical example, is the techniques in this modular lazy search paper:

http://web.cecs.pdx.edu/~apt/jfp01.ps

They build simple solvers, like backtracking, backjumping, etc. and
then compose them together like: bt . bj

The techniques are very much based on laziness. 

- jeremy

At Thu, 9 Jul 2009 14:55:09 +0200,
Cristiano Paris wrote:
> 
> [1  <multipart/alternative (7bit)>]
> [1.1  <text/plain; ISO-8859-1 (7bit)>]
> 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
> [1.2  <text/html; ISO-8859-1 (quoted-printable)>]
> 
> [2  <text/plain; us-ascii (7bit)>]
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe