Browse thread
[Caml-list] Does Caml have slow arithmetics ?
-
Diego Olivier Fernandez Pons
- Richard Jones
-
Basile Starynkevitch [local]
- Diego Olivier Fernandez Pons
-
Evgeny Chukreev
-
Xavier Leroy
- Evgeny Chukreev
-
skaller
- David Brown
- Alex Baretta
- Jon Harrop
-
Xavier Leroy
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ 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 accurate!) + 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). --Luc > Dave > ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners