On Tue, 2004-09-28 at 05:08, John Goerzen wrote:

> 1. Haskell lists resemble OCaml Streams

Laziness -> control inversion -> duality

lists and streams are categorical duals

> 2. Haskell strings are lists of characters

Performance implications ..

> 3. The Num typeclass

Non general attempt to provide polyadic programming.

> OCaml enlightenment appreciated :-)

I would guess Ocaml wins in performance. Shootout at alioth gives:

(CRAPS scores)

gcc -- 57
ocamlopt -- 40
ghc -- 18
ocamlbyte -- 15
python -- 16
felix -- 3.3 (ouch!)
curry (Haskell) -- 0.13

which seems to indicate, at least for statically
typed languages, that performance is most closely
related to the intensity of effort put into the
optimiser.

However, Haskell being purely functional may
make high performance data structures unavailable,
for example arrays (time in secs)

gcc -- 0.02
ocaml -- 0.04
ghc -- 1.4

-- 
John Skaller, mailto:skaller@users.sf.net
voice: 061-2-9660-0850, 
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language http://felix.sf.net



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