Boxing and generics with type erasure making it difficult or impossible to
reduce the density of references in the heap. Structs and reified genericsý
can give huge performance improvements. Hash tables and complex arithmetic
are some examples where I often see F# running 5-20ª faster than idiomatic
OCaml/Java code.

Cheers,
Jon.

> -----Original Message-----
> From: caml-list-bounces@yquem.inria.fr [mailto:caml-list-
> bounces@yquem.inria.fr] On Behalf Of Erik de Castro Lopo
> Sent: 24 November 2010 01:24
> To: caml-list@inria.fr
> Subject: Re: [Caml-list] Is OCaml fast?
> 
> Jon Harrop wrote:
> 
> > Many of the things that can make OCaml and Java slow were inherited
> > from Lisp. They are, in effect, designs that still bear the burden
> > of dynamic typing despite being statically typed.
> 
> I'm curious, what in your opinion are those things?
> 
> Erik
> --
> ----------------------------------------------------------------------
> Erik de Castro Lopo
> http://www.mega-nerd.com/
> 
> _______________________________________________
> Caml-list mailing list. Subscription management:
> http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
> Archives: http://caml.inria.fr
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs