[Haskell-cafe] Monad proof

[Rodrigo Geraldo]

Did you see this?

http://okmij.org/ftp/Computation/proving-monad-laws.txt

[]'s


Rodrigo Geraldo Ribeiro.

PhD student - UFMG

On Fri, Apr 11, 2008 at 2:35 PM, Rafael C. de Almeida <almeidaraf at gmail.com>
wrote:

> Hello,
>
> I was studying Monads and I was trying to think about new Monads I could
>  define. So, a question poped into my mind: how is proof regarding the 3
> Monad laws handled? I know that, aside from testing all the possible values
> (and there can be a lot of them), there's no general way to prove it.
> Nonetheless, I think that it would be insightful to see how people write
> those proofs for their monads -- specially for new user monads. Is there
> some article or some notes on proving that Monads are implemented correctly?
>
> []'s
> Rafael
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20080411/82cd44ec/attachment.htm