6 ms·
And my point is that Haskell doesn't even look like it's run from top to bottom. Example, consider this mutually recursive definition at the top level: a
by kccqzy 6y ago
And my point is that Haskell doesn't even look like it's run from top to bottom.
Example, consider this mutually recursive definition at the top level:
a = 1:b
b = 2:a
It doesn't, by any means logical or not, look like it runs from top to bottom. If so, the first line would have immediately been an error because `b` is an undefined name.
- deleted 6y ago[deleted]
- zepto 6y agoMy mistake - I thought Haskell was like OCaml in not having a main function: http://stackoverflow.com/questions/28711563/ddg#28711778 http://stackoverflow.com/questions/28711563/ddg#28711778 You broadly dismissed my entire comment, which was completely correct about Ocaml, but I accept that you are correct about Haskell.