Did you see this?<br><br><a href="http://okmij.org/ftp/Computation/proving-monad-laws.txt">http://okmij.org/ftp/Computation/proving-monad-laws.txt</a><br><br>[]&#39;s<br><br><br>Rodrigo Geraldo Ribeiro.<br><br>PhD student - UFMG<br>
<br><div class="gmail_quote">On Fri, Apr 11, 2008 at 2:35 PM, Rafael C. de Almeida &lt;<a href="mailto:almeidaraf@gmail.com">almeidaraf@gmail.com</a>&gt; wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hello,<br>
<br>
I was studying Monads and I was trying to think about new Monads I could &nbsp;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&#39;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?<br>

<br>
[]&#39;s<br>
Rafael<br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org" target="_blank">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</blockquote></div><br>