One more thing: OCaml is strict by default, Haskell is lazy by default. The late... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

spott on July 16, 2014 | parent | context | favorite | on: Why We Use OCaml

One more thing: OCaml is strict by default, Haskell is lazy by default. The later allows for some nice code idioms[0], but makes reasoning about performance and memory characteristics very difficult[1].

[0] indexedList :: [a] -> [(Integer,a)] indexedList l = zip [1..] l

[1] http://www.reddit.com/r/haskell/comments/15h6tz/what_isnt_ha...

http://www.haskell.org/pipermail/haskell-cafe/2013-September...

http://stackoverflow.com/questions/2064426/reasoning-about-p...

yawaramin on July 17, 2014 [–]

Or even:

indexedList = zip [1..]

Love how ML-like languages let you express just the bare essence of an operation.

spott on July 23, 2014 | [–]

Yea, I didn't do that just to make it clearer: if you aren't used to ML, I Imagine that this would be very confusing.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact