[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Peng Zang <peng.zang@g...> |
| Subject: | Re: [Caml-list] Haskell vs OCaml |
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Thursday 14 August 2008 09:57:47 am Jon Harrop wrote: > Monads and zippers? They can be useful for the same reasons they are in Haskell. You can always write OCaml code like Haskell code, it's just not always easiest to do it that way. > Even if Haskell's performance is improved it will remain unpredictable and, > consequently, it will continue to be impossible to optimize non-trivial > Haskell programs. That's true, but I think Haskell's point of view is to stop that completely. They want to remove optimization of code and put it into the hands of the compiler. The ideal is to say to the programmer: "don't worry about performance and optimization, just write correct code. The compiler will figure out the rest". Clearly we're not at that point, and perhaps that ideal is a long ways to become true if possible at all. But you gotta give them props for the idea. It would be nice to only care about correctness and not performance. Peng -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.7 (GNU/Linux) iD8DBQFIpDvifIRcEFL/JewRAvCyAJwNdNYMEx8TKWwwDB1D6X3C5258uwCghlP3 ZaogvTv/CydHsPQ+ETA/+KI= =eQDx -----END PGP SIGNATURE-----