[Haskell-cafe] walking a directory tree efficiently
dons at galois.com
Tue Jan 13 18:27:08 EST 2009
> During a tentative (quite unsuccessfull) to convert a simple Python
> script that prints on stdout a directory and all its subdirectory  in
> a good Haskell (mostly to start to do real practice with the language),
> I came across this blog post:
> Since recently I read about alternatives to lazy IO (like iteratee), I'm
> curious to know if a flexible, efficient and safe alternative exists,
> for the task of display a directory tree.
>  http://paste.pocoo.org/show/99523/
If you can do it with strict IO in Python, do the same thing in Haskell
with System.IO.Strict. It should be mechanical to translate Python
programs directly into naive IO-based Haskell using strict IO. Boring,
There's no iteratee/fold-based IO system yet.
More information about the Haskell-Cafe