I wrote: >> How about a built-in function that represents a directory tree >> as a lazy Data.Tree?
Jules Bean wrote: > Please no. > The last thing haskell needs is more dangerous semantically broken > non-referentially-transparent lazy IO structures. Agreed. I would definitely not want it to be a dangerous semantically broken non-referentially-transparent lazy IO structure. -Yitz _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
