From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id MAA14043; Mon, 12 May 2003 12:08:03 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id MAA13925 for ; Mon, 12 May 2003 12:08:02 +0200 (MET DST) Received: from iona.labri.fr (majordomo.labri.fr [147.210.8.168]) by nez-perce.inria.fr (8.11.1/8.11.1) with ESMTP id h4CA82T23252 for ; Mon, 12 May 2003 12:08:02 +0200 (MET DST) Received: from localhost (localhost.localdomain [127.0.0.1]) by localhost.labri.fr (Postfix) with ESMTP id DF2A517C99; Mon, 12 May 2003 12:08:01 +0200 (CEST) Received: from iona.labri.fr ([127.0.0.1]) by localhost (iona.labri.fr [127.0.0.1:10024]) (amavisd-new) with SMTP id 21481-05; Mon, 12 May 2003 12:08:00 +0200 (CEST) Received: from amrita.labri.fr (amrita.labri.fr [147.210.8.242]) by iona.labri.fr (Postfix) with ESMTP id 67AE717C93; Mon, 12 May 2003 12:08:00 +0200 (CEST) Date: Mon, 12 May 2003 12:14:03 +0200 Subject: Re: [Caml-list] tree walking with... specular rec functions? what else? Content-Type: text/plain; charset=ISO-8859-1; format=flowed Mime-Version: 1.0 (Apple Message framework v543) Cc: caml-list@inria.fr To: stalkern2@tin.it From: =?ISO-8859-1?Q?G=E9rard_Huet?= In-Reply-To: <200305120855.06867.stalkern2@tin.it> Message-Id: <753A0276-8462-11D7-8454-0003938819CE@inria.fr> Content-Transfer-Encoding: quoted-printable X-Mailer: Apple Mail (2.543) X-Virus-Scanned: by amavisd-new X-Spam: no; 0.00; huet:01 caml-list:01 stalkern:01 downwards:01 sept:99 uni-bonn:01 ralf:01 appsem:01 functor:01 ecrit:01 caml:01 remy:01 afaik:01 rec:01 tree:02 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk Le lundi, 12 mai 2003, =E0 08:55 Europe/Paris, Stalkern 2 a =E9crit : > 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=E9rard 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=20 > this list > http://caml.inria.fr/archives/200304/msg00202.html and I was suggested=20= > to > take a look at=20 > 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=20= subject are given in "Linear Contexts and the Sharing Functor: Techniques for Symbolic=20 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