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
JIT-compilation for OCaml?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2001-01-04 (13:05)
From: STARYNKEVITCH Basile <Basile.Starynkevitch@c...>
Subject: RE: JIT-compilation for OCaml?
>>>>> "Mattias" == Mattias Waldau <> writes:

    Mattias> If you just want portability, then why not generate
    Mattias> Java-byte code instead of Ocaml-bytecode. 

It is well known (e.g. see the Kawa implementation of Scheme on the
JVM) that the Java Virtual Machine is not well suited for functional
programming: function closures and tail-recursion calls (which are
actually jump with arguments) do not exist in the JVM, and emulating
them (e.g. closures as instances of specially generated classes) is
quite inefficient. The JVM is not as universal as Sun's marketing hype
claim it is...

On the contrary the Ocaml virtual machine was (of course) designed for
functional programming, and efficiently implement tails calls and
closure constructions.

Regards and Happy New Year to all,

N.B. Any opinions expressed here are only mine, and not of my organization.
N.B. Les opinions exprimees ici me sont personnelles et n engagent pas le CEA.

Basile STARYNKEVITCH   ----  Commissariat à l Energie Atomique 
DTA/LETI/DEIN/SLA * CEA/Saclay b.528 (p111f) * 91191 GIF/YVETTE CEDEX * France
phone: 1,; fax: home: 1,
email: Basile point Starynkevitch at cea point fr 
web perso: