30 Apr
2005
30 Apr
'05
4:59 p.m.
Jan-Willem Maessen <jmaessen@alum.mit.edu> 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.QuickC... -- Programming is the Magic Executable Fridge Poetry, | www.ScannedInAvian.com It is machines made of thought, fueled by ideas. | -- Shae Matijs Erisson