[Haskell-cafe] Re: Laws and partial values

Claus Reinke claus.reinke at talk21.com
Sun Jan 25 12:13:50 EST 2009

>> Yes.  If you've got a set of terminating computations, and it has
>> multiple distinct elements, it generally doesn't *have* a least element.
>> The P in CPO stands for Partial.
> and this concern does not apply to ()  .

Btw, what would a non-lifted () be used for?

If the least element _|_ is known to be the only element (), 
there isn't anything to do, indeed, there isn't even anything 
to store at runtime, as the locations of those statically fully 
known elements is also known statically, from the types.


More information about the Haskell-Cafe mailing list