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 UAA24432 for caml-red; Sat, 5 Aug 2000 20:11:00 +0200 (MET DST) Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id UAA05559 for ; Fri, 4 Aug 2000 20:23:28 +0200 (MET DST) Received: from nef.ens.fr (nef.ens.fr [129.199.96.32]) by concorde.inria.fr (8.10.0/8.10.0) with ESMTP id e74INLX26660 for ; Fri, 4 Aug 2000 20:23:21 +0200 (MET DST) Received: from clipper.ens.fr (clipper-gw.ens.fr [129.199.1.22]) by nef.ens.fr (8.10.1/1.01.28121999) with ESMTP id e74INKT57509 ; Fri, 4 Aug 2000 20:23:20 +0200 (CEST) Received: from localhost (frisch@localhost) by clipper.ens.fr (8.9.2/jb-1.1) id UAA03611 ; Fri, 4 Aug 2000 20:23:20 +0200 (MET DST) Date: Fri, 4 Aug 2000 20:23:20 +0200 (MET DST) From: Alain Frisch To: Julian Assange cc: caml-list@inria.fr Subject: Re: explict vs inexplicit constant parameters In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: weis@pauillac.inria.fr On 3 Aug 2000, Julian Assange wrote: > ... > Is ocaml able to generate faster code for the former? > This is a FAQ: http://caml.inria.fr/ocaml/speed.html http://caml.inria.fr/FAQ/FAQ_EXPERT-eng.html#curry_et_rec << Should I use local functions to factor out invariant parameters of a recursive function? >> -- Alain Frisch