Jan-Willem Maessen <[EMAIL PROTECTED]> writes: >> PS: your discussion of the laws of MonadPlus reinforces to me the real need >> for being able to declare the laws that a typeclass should satisfy, not just >> the signature. > On this I cannot but agree. But we don't usually count on being able to > prove these by construction.
Still, including QuickCheck tests for typeclass laws would be nice. For example, QuickCheck.Utils has isAssociative, isCommutable, isTotalOrder. http://www.haskell.org/ghc/docs/latest/html/libraries/QuickCheck/Test.QuickCheck.Utils.html -- Programming is the Magic Executable Fridge Poetry, | www.ScannedInAvian.com It is machines made of thought, fueled by ideas. | -- Shae Matijs Erisson _______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
