[Haskell-cafe] Byte Histogram

Andrew Coppin andrewcoppin at btinternet.com
Sat Feb 5 16:21:57 CET 2011

>> That got me thinking... What would happen if, instead of "Integer", we had two types, "evaluated Integer" and "possibly unevaluated Integer"? What if the strictness or otherwise of a data structure were exposed at the type level?
> Oh, you mean like "!Int" and "Int" in Clean?  I used to find bang *types* rather easier to deal with
> than I now do bang *patterns*.
>> I have no idea what the syntax for that would look like,
> Clean?

I didn't think Clean supported laziness at all? I thought it was a 
strict language.

More information about the Haskell-Cafe mailing list