[Haskell-cafe] A free monad theorem?

Tomasz Zielonka tomasz.zielonka at gmail.com
Thu Aug 31 16:26:43 EDT 2006


On Thu, Aug 31, 2006 at 10:16:38PM +0200, Tomasz Zielonka wrote:
>     Cont (const ()) :: Cont () a        -- from Control.Monad.Cont
> 
>         whatever you do, you won't be able to extract an 'a' typed
>         value, non-bottom from this computation.

Unless you substitute () for 'a', of course :-)

Best regards
Tomasz


More information about the Haskell-Cafe mailing list