Version française
Home     About     Download     Resources     Contact us    
Browse thread
Is OCaml fast?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Christophe Troestler <Christophe.Troestler+ocaml@u...>
Subject: Re: [Caml-list] Re: Is OCaml fast?
On Wed, 24 Nov 2010 06:50:15 +0000, Isaac Gouy wrote:
> 
> Jeff Meister <nanaki <at> gmail.com> writes:
> 
> > We know what your rules are for binary-trees; repeating them does
> > not help.
> 
> When Christophe TROESTLER wrongly states - "OCaml is not authorized
> to make use of its very own library!" - he shows that those rules
> are not known.

Isolating a sentence gives a misleading idea of what I said.  Must I
really repeat that I was asking WHY is C allowed to use an external
library to enhance its memory management¹ but OCaml cannot use its own
library to do that.  I am not asking WHAT the rules are but a
JUSTIFICATION for them (which you have been incapable of providing so
far).

C.


¹ Apparently the "Please don't implement your own custom memory pool
or free list." does not count if it's implemented by others!