Re: [Caml-list] Alternative Bytecodes for OCaml

[John Goerzen <jgoerzen@complete.org>]

On Wednesday 25 August 2004 5:10 pm, Yamagata Yoriyuki wrote:
> The conclusion of the F#, and several SML-to-Java bytecode projects
> is that JVM and .NET are too restricted to OO paradigm, I remember.
> See the thread begins
> http://caml.inria.fr/archives/200102/msg00048.html

I'm not sure I buy that.  For one, Python already exists for both, and I 
believe it implements all the stumbling blocks commonly mentioned here 
save for tail recursion optimization.  Secondly, there are functional 
languages existing for .NET: Nemerle, SML, Haskell (via both ghc and 
Hugs), Scheme, Lisp.  I hardly think that one could claim that either 
VM is too limited to make an implementation.  We even have preliminary 
OCaml interpreters for Java, and the Nemerle language is *very* similar 
to OCaml.  The syntax is different, but from what I've seen, the 
language is similar enough that it should be possible to make a camlp4 
printer to output in Nemerle.

An *efficient* implementation is another matter, but one I'm not highly 
concerned about.  Those that are going to be doing sophisticated 
numerical analysis can stick with ocamlopt.

Most of my programs are non-interactive and execute in less than 1 
second even if given huge volumes of data.  I don't really care if 
they're 10 times slower.  The development time saved having to write 
Yet Another Glue or more libraries is far more valuable.

-- John

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