Re: [Caml-list] Local functions with arguments or closures ?

[Yitzhak Mandelbaum <yitzhakm@CS.Princeton.EDU>]

Daniel,

I can't speak definitively, but in my experience, the cost of using a closure had a noticeable performance impact when writing loops as recursive functions. 

Yitzhak

On Jun 7, 2012, at 1:34 PM, Daniel Bünzli wrote:

> Hello, 
> 
> In the past I remember having indirectly benchmarked two different styles for writing local functions :
> 
>    let f x = 
>      let v = ... in
>      let rec loop x v = ... in 
>      loop x v 
> 
> or 
> 
>    let f x = 
>        let v = ... in
>        let rec loop () = ... (* uses v and x *) in 
>        loop ()
> 
> without being able to reach a conclusion. Is there any particular style that is definitively faster ? Does it maybe depend on the number of arguments and/or on whether loop is recursive or not ? 
> 
> This question keeps coming back in my mind when I write local functions... I'm sure someone with some knowledge of the compiler's internals can provide a more reasonable answer than benchmarks.  
> 
> Best,
> 
> Daniel
> 
> 
> 
> 
> 
> -- 
> Caml-list mailing list.  Subscription management and archives:
> https://sympa-roc.inria.fr/wws/info/caml-list
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs
> 

-----------------------------
Yitzhak Mandelbaum