Chris King a écrit :
> On 10/21/06, Christophe Raffalli <raffalli@univ-savoie.fr> wrote:
>>
>> consider this piece of code:
>>
>>   (try
>>     let b = f a in
>>     (fun () -> g b)
>>   with
>>     (fun () -> h a)) ()
>>
>>
>> Is the call to "g" a tail call and is it omptimized as such ?
>
> Yes, it is, at least in the assembly code output by ocamlopt.  (Neat
> trick, btw.)
>
OK, but when g b is in fact a piece of code using a lot of values, it 
seems that the call is no more tail call and
the stack keeps far to much values ... anyway, I am rewriting my code in 
a completely different (and better) way to avoid the problem ...
but it would be nice to know exactly what call are tailcalls and what 
value are stored in closure in all cases.

Christophe