Today I've been learning about the wonders of QuickCheck. :-)
One (obvious?) question that is not addressed in at least the original paper
is how one might use QC to automatically verify the algebraic laws that are
often associated with type classes. E.g., could we add some QC properties
as members of the Functor class and somehow arrange (probably by some
combination of automation and idiom) that they would be checked every time
somebody creates an instance of Functor?
Regards,
- Benjamin
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
