Le lundi, 12 mai 2003, à 08:55 Europe/Paris, Stalkern 2 a écrit :

> Il  Sunday 11 May 2003 18:02, Xavier Leroy ha scritto:
>>> I've a simple tree structure and I want to walk it. Since in such a
>>> simple tree structure I can go AFAIK only sidewards or
>>> upwards/downwards, and I need to do both, I guess what can be an
>>> efficent way to do so.
>>
>> That sounds like a job for Gérard Huet's "zippers":
>>
>> G. Huet. The Zipper. Journal of Functional Programming, 7 (5), Sept
>> 1997, pp. 549--554.
>>
>> Apparently, the paper isn't freely available on-line, but see
>>
>> http://www.informatik.uni-bonn.de/~ralf/publications/TheWeb.ps.gz
>>
>> for a quick overview of the zipper, and more advanced stuff.
>>
>
> Thank you very much. I'm now using also a posting about zippers on 
> this list
> http://caml.inria.fr/archives/200304/msg00202.html and I was suggested 
> to
> take a look at 
> http://pauillac.inria.fr/~remy/cours/appsem/ocaml-ml.html
>

Hello
My original zipper paper is not on-line, but my latest thoughts on the 
subject are given in
"Linear Contexts and the Sharing Functor: Techniques for Symbolic 
Computation", available from
http://pauillac.inria.fr/~huet/PUBLIC/DB.pdf
Gerard

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners