Re:Dynamic languages are static languages
by prodigal_erik on Monday March 21, 2011 @12:33AM
(#2348491)
Please don't use "strict" regarding a language's type checking. It's already used in domain theory for functions which rely on arguments being well-defined and computable. It is one of Haskell's defining features that by default, functions and data structures are not strict.
http://en.wikipedia.org/wiki/Domain_theory
http://en.wikibooks.org/wiki/Haskell/Denotational_semantics