Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

2
  • 5
    Haskell is among the very few non-strict languages - the entire ML family (aside from some research spinoffs which add laziness), all popular Lisps, Erlang, etc. are all strict. Also, the second paragraphs seems off - as you correctly state in the first paragraph, laziness does allows infinite recursion (the Haskell prelude has the immensely useful forever a = a >> forever a for instance). Commented May 18, 2012 at 13:02
  • @deinan: As far as I know SML/NJ also offers lazy evaluation but it is an addition to SML. I also wanted to name two of the few lazy functional languages: Miranda and Clean. Commented May 18, 2012 at 16:18