From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from weis@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id JAA19642 for caml-red; Sat, 7 Oct 2000 09:37:57 +0200 (MET DST) 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 KAA12782 for ; Fri, 6 Oct 2000 10:15:22 +0200 (MET DST) Received: from miss.wu-wien.ac.at (miss.wu-wien.ac.at [137.208.107.17]) by nez-perce.inria.fr (8.10.0/8.10.0) with ESMTP id e968FLj20441 for ; Fri, 6 Oct 2000 10:15:22 +0200 (MET DST) Received: (from mottl@localhost) by miss.wu-wien.ac.at (8.9.0/8.9.0) id KAA19220; Fri, 6 Oct 2000 10:15:11 +0200 (MET DST) Date: Fri, 6 Oct 2000 10:15:11 +0200 From: Markus Mottl To: Patrick M Doane Cc: David McClain , caml-list@inria.fr Subject: Re: de Bruijn indices Message-ID: <20001006101511.A18311@miss.wu-wien.ac.at> References: Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline User-Agent: Mutt/1.2.5i In-Reply-To: ; from patrick@watson.org on Thu, Oct 05, 2000 at 19:29:30 -0400 Sender: weis@pauillac.inria.fr On Thu, 05 Oct 2000, Patrick M Doane wrote: > You should take a look at Frank Pfenning's course notes for his class on > Computation and Deduction. The chapter on compilation covers the use of de > Bruijn indices as well some interesting judgements abouts the compilation > process. This chapter is located at: De Bruijn indices are, btw., also explained (and implemented) in the tutorial "Functional Programming using Caml Light" in Chapter 12: http://caml.inria.fr/tutorial/index.html People who are interested in optimum performance for handling bindings might also want to try out Christophe Raffalli's "bindlib": http://www.lama.univ-savoie.fr/sitelama/Membres/pages_web/RAFFALLI/bindlib.html It's said to be even more efficient. Best regards, Markus Mottl -- Markus Mottl, mottl@miss.wu-wien.ac.at, http://miss.wu-wien.ac.at/~mottl