On 27 jun 2007, at 18.41, Hans van Thiel wrote:
[snip]
Thanks, Apfelmus, for the references. Guess I'll start there, then.
And
thanks, Chris, for the info and code. Read only 'up pointers' could be
what is needed. But before going on, I want first to get more
confortable with programming with trees. It's all very well to say
they're easy to roll, but lists are even simpler, and look at them...
I guess it's in the papers, too, but the chapter on zippers in the
Wikibook is very nice, too:
http://en.wikibooks.org/wiki/Haskell/Zippers
/ Thomas
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
