From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id 813B2BB9A for ; Fri, 28 Oct 2005 23:09:57 +0200 (CEST) Received: from pih-relay05.plus.net (pih-relay05.plus.net [212.159.14.132]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id j9SL9urm011854 (version=TLSv1/SSLv3 cipher=AES256-SHA bits=256 verify=NO) for ; Fri, 28 Oct 2005 23:09:57 +0200 Received: from [80.229.56.224] (helo=chetara) by pih-relay05.plus.net with esmtp (Exim) id 1EVbU4-0003qG-4N for caml-list@yquem.inria.fr; Fri, 28 Oct 2005 22:09:56 +0100 From: Jon Harrop Organization: Flying Frog Consultancy Ltd. To: caml-list@yquem.inria.fr Subject: Re: [Caml-list] OCaml efficiency/optimization? Date: Fri, 28 Oct 2005 21:00:12 +0100 User-Agent: KMail/1.7.2 References: <1130494903.8339.246224558@webmail.messagingengine.com> <200510281315.21425.jon@ffconsultancy.com> In-Reply-To: <200510281315.21425.jon@ffconsultancy.com> MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit Content-Disposition: inline Message-Id: <200510282100.13229.jon@ffconsultancy.com> X-Miltered: at nez-perce with ID 436293A4.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; caml-list:01 ocaml:01 ocaml:01 recursion:01 inria's:01 okasaki:01 frog:98 wrote:01 tail:01 structures:01 structures:01 thesis:01 data:02 data:02 caml:02 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.3 On Friday 28 October 2005 13:15, Jon Harrop wrote: > I don't know if it classifies as "official", but my OCaml book has a > chapter on optimisation that covers tail recursion. There are also a couple of official pages on INRIA's site that I forgot about: http://pauillac.inria.fr/ocaml/speed.html http://pauillac.inria.fr/ocaml/numerical.html and the books: "Introduction to algorithms" by Cormen et al. for general information. "Purely functional data structures" by Chris Okasaki for MLized data structures. The latter is also freely available as a PhD thesis. -- Dr Jon D Harrop, Flying Frog Consultancy Ltd. Objective CAML for Scientists http://www.ffconsultancy.com/products/ocaml_for_scientists