[Haskell-cafe] Monads, do and strictness

MigMit miguelimo38 at yandex.ru
Sun Jan 22 17:47:21 CET 2012

Отправлено с iPad

22.01.2012, в 20:25, David Barbour <dmbarbour at gmail.com> написал(а):
> Attempting to shoehorn `undefined` into your reasoning about domain algebras and models and monads is simply a mistake. 

No. Using the complete semantics — which includes bottoms aka undefined — is a pretty useful technique, especially in a non-strict language.

More information about the Haskell-Cafe mailing list