[Haskell-beginners] Fast tree manipulation

[Gabi]

I might be wrong but I think this is a weak spot for many functional
langs, including Haskell - The ability to manipulate in high rate data
structures without killing the performance . Even in langs like
Clojure, which enable the cheap creation of new modified structures
out of old ones(using "persistent structures") -it is much slower than
using an imperative language to manipulate data in place. What is the
approach of Haskell to this ?

-- 
Regards,
Gabi

http://bugspy.net