Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Lamda expressions and a caml interpreter
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2004-03-12 (18:22)
From: Alex Baretta <alex@b...>
Subject: Re: [Caml-list] Lamda expressions and a caml interpreter
Nuutti Kotivuori wrote:
> Alex Baretta wrote:
>>Unfortunately, this approach to dynamic programming has two
>>problems: it is incompatible with a native code compilation of the
>>main program, which otherwise could take advantage of the speed
>>benefits of ocamlopt, and a memory leak due to the impossibility of
>>unlinking bytecode modules. The latter problem is the major one.
> The former problem is solved by Asmdynlink module. It last worked at
> 3.02 I believe, but there is hope that someone could resurrect it.

The former problem is no big deal, since the Caml team made the VM so 
efficient that for most practical purposes bytecode is good enough. I 
can live with it until Xavier will release Dynlink for native code.

> The latter problem I have an unfinished patch to fix. You may browse
> the list archives to know more or ask me directly.

I am aware of your patch. However, before using it in production code I 
would have to see it adopted by Inria in the CVS or official releases. 
Otherwise, I would risk breaking compatibility of my code with future 
releases of Ocaml.

I look forward to seeing dynamic unlinking of code (bytecode or native) 
in OCaml. Hopefully, your patch will help in this direction.


To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: