[Haskell-cafe] strict, lazy, non-strict, eager

Edward Z. Yang ezyang at MIT.EDU
Sat Dec 24 14:41:34 CET 2011


> 1. a function f is strict if  f ⊥ = ⊥
> 2. ⊥ represents any computation which does not terminate, i.e. an 
> exception or an infinite loop
> 3. "strict" describes the denotational semantics
> 
> People, could you please make up your mind already? It has been more 
> than 13 years.

I have to admit, I'm a bit confused what the complaint is.

Edward



More information about the Haskell-Cafe mailing list