Tomasz Zielonka wrote:
When it comes to Haskell, speed is mostly an implementation issue.
Of course, there are many problems with making Haskell programs
run fast, but on the other hand there are also many opportunities.
For example recent developments of GHC promise that Haskell will
be one of the best languages to use on SMP / multicore systems.
So we can expect Haskell to get faster as GHC evolves and multicore
systems becomre more common...
There are many differences (Haskell on the left):
- pure / impure
Let's see if I understand this one. Haskell and OCaml both treat
functions as first class objects, including the ability to pass
functions as arguments or return functions. But OCaml allows you to
change the value of a variable and that's what makes it impure. Yes?
Does this mean that it's harder to prove an OCaml program correct? Or
that you have to be careful to not accidentally change the value of
variables?
I've taken a glance at an OCaml tutorial, and the syntax looks a little
more difficult than Haskell's (e.g. "rec" for recursive functions).
- pretty / ugly
:-)
Cheers,
Daniel.
--
/\/`) http://oooauthors.org
/\/_/ http://opendocumentfellowship.org
/\/_/
\/_/ I am not over-weight, I am under-tall.
/
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
