
24 Dec
2011
24 Dec
'11
8:41 a.m.
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