Link Details

When designing programming languages, the hard choice is not about what you put into the language -- it is what you leave out or what is mutually exclusive. Haskell did make the choice of being a purely functional programming language and they did the choice of being lazy. The positive things manifesting from this is: Lazy evaluation finds more normal forms than strict evaluation. In the simply typed lambda calculus it finds all of them but I am not sure this is the case in Haskell.