Browse thread
OCaml troll on Slashdot
-
Karl Zilles
-
Oliver Bandel
-
Michael Vanier
-
Jon Harrop
-
Yoann Padioleau
- Jon Harrop
- Paul Argentoff
- Paul Argentoff
-
Yoann Padioleau
-
Jon Harrop
- Yoann Padioleau
-
Michael Vanier
- Richard Jones
-
Oliver Bandel
[
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: | Christian Szegedy <szegedy@t...> |
| Subject: | Re: [Caml-list] OCaml troll on Slashdot |
brogoff wrote: >I just ran your counterexample and the tail recursive code was faster >for each. I used native code compilation. > >Byte code compilation gives similar results to yours, except that as I ran the >test on "ye olde SPARC machine", it took a hell of a lot longer. > > As far as I know, the bytecode compiler does not eliminate tail calls.