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: | Yaron Minsky <yminsky@g...> |
| Subject: | Re: [Caml-list] OCaml troll on Slashdot |
On Wed, 16 Mar 2005 19:35:17 -0800 (PST), brogoff <brogoff@speakeasy.net> wrote: > Anyways, long lists do occur, and Stack_overflow at the customer site sucketh > bigtime. I completely agree. As someone who makes extensive use of OCaml in a business setting, the fact that the standard libraries throw exceptions on large data structures is a real pain. It's a violation of the principle of least surprise, and I've run into it in practice quite a few times. Our solution was to just rewrite the list module with tail-recursive versions. We're happy to make the performance tradeoff. If we really want things to be fast, List.map is no good anyway, due to the lack of inlining of the function parameter. I do think that it would be a great thing if the tail-recursive list functions were moved into the standard library. Yaron