Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Does Caml have slow arithmetics ?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Luc Maranget <Luc.Maranget@i...>
Subject: Re: [Caml-list] Does Caml have slow arithmetics ?
> On Thu, Jul 08, 2004 at 11:51:10AM +0200, Andreas Rossberg wrote:
> Many ocaml programs depend on tail-call elimination, although I don't
> believe anything in the docs requires it to be done.

Well, when programming in caml, I use the following rules (which I hope to be

+ ocamlc does perform tail call elimation
+ ocamlopt does it less often. Namely, calls in tail position
  become real tail calls when all their arguments are passed in registers.
  (This does not apply to self-tail calls which are always optimized)

  On pentiums/x86/IA32 this means that tail calls are performed when the callee
  has four arguments or less (if I remember well).


> Dave

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: