Bonjour,

On Fri, 13 Aug 2004, Christophe Raffalli wrote:

> The cost of conservative GC is the test to know if an int is
> pointing in (or at the beginning) of an allocated block which
> require for instance a hashtbl of allocated blocks by adress ranges.
> I don't know if the gain for arithmetic + easier C interface would
> compensate the lost in the GC for a real GC like Caml's.

How does the GC of mlton work ? If I understood correctly mlton does
have 32-bit integers so if it has a mark-and-copy family garbage
collector, its tags are kept apart.

ML-Kit has a region garbage collector. It collects static information
by analyzing the source-code at compile time but it is not enough so
it is combined with an other kind of 'dynamically computed' collection
(also by regions if I understood correctly the simple explanations of
the user manual)

Maybe could you find more information (or at least their filling) on
the subject ? (C interface, performances, etc.)

        Diego Olivier





-------------------
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