(So that's how you say "tail-recursive" in French...)
Xavier Leroy wrote in article
<49cb9854.1020...@inria.fr> in gmane.comp.lang.caml.inria:
> A technique that always works is to convert your function to
> continuation-passing style. The resulting code is hard to read and
> not particularly e
Richard Jones <[EMAIL PROTECTED]> wrote in article <[EMAIL PROTECTED]> in
gmane.comp.lang.caml.inria:
> It's crying out for someone to invent a tool which actually
> understands the syntax of the code in the files (not just as plain
> text) and creates a more robust and easier to read format.
Her
Jon Harrop <[EMAIL PROTECTED]> wrote in article <[EMAIL PROTECTED]> in
gmane.comp.lang.caml.inria:
> On Monday 06 October 2008 15:06:12 you wrote:
> > I'm definitely missing something here. How are the above examples
> > different from:
> > let f () = 1 + 2;;
> > f ();;
> > let f x = 1 + x;;
> >
