ClassLaws: Stating and checking laws for type class methods

[ bsd3, library, testing ] [ Propose Tags ]

The specification of a class in Haskell often starts with stating, in text, the laws that should be satisfied by methods defined in instances of the class, followed by the type of the methods of the class. The ClassLaws library is a framework that supports testing such class laws using QuickCheck. Our framework is a light-weight class law testing framework, which requires a limited amount of work per class law, and per datatype for which the class law is tested. We also show how to test class laws with partially-defined values. Using partially-defined values, we show that the standard lazy and strict implementations of the state monad do not satisfy the expected laws. More information can be found at Built with ghc-7.4.2 and ghc-7.6.1. (Fails to build with ghc-7.2.2 due to Could be worked around.)


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],,,
Dependencies base (>= && <5), ChasingBottoms (>=1.3 && <2), mtl (>=1 && <3), QuickCheck (>=2 && <2.5) [details]
License BSD-3-Clause
Author Patrik Jansson and Johan Jeuring
Category Testing
Home page
Uploaded by PatrikJansson at 2012-09-14T15:09:05Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 3897 total (4 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]