quickspec: Equational laws for free!
|Versions||0.9, 0.9.1, 0.9.2, 0.9.3, 0.9.4, 0.9.5, 0.9.6, 2|
|Dependencies||base (==4.*), constraints, containers, data‑lens‑light (>=0.1.1), dlist, QuickCheck (>=2.10), random, reflection, template‑haskell, transformers, twee‑lib (==2.1.2), uglymemo [details]|
|Copyright||2009-2018 Nick Smallbone|
|Revised||Revision 1 made by NickSmallbone at Mon Feb 26 16:29:34 UTC 2018|
|Source repo||head: git clone git://github.com/nick8325/quickspec.git -b master|
|Uploaded||by NickSmallbone at Fri Feb 23 14:47:06 UTC 2018|
|Downloads||2941 total (117 in the last 30 days)|
|Rating||1.75 (votes: 1) [estimated by rule of succession]|
|Status||Docs available [build log]
Last success reported on 2018-02-23 [all 1 reports]
Hackage Matrix CI
QuickSpec takes your Haskell code and, as if by magic, discovers laws about it. You give QuickSpec a collection of Haskell functions; QuickSpec tests your functions with QuickCheck and prints out laws which seem to hold.
For example, give QuickSpec the functions
it will find six laws:
reverse  ==  xs ++  == xs  ++ xs == xs reverse (reverse xs) == xs (xs ++ ys) ++ zs == xs ++ (ys ++ zs) reverse xs ++ reverse ys == reverse (ys ++ xs)
QuickSpec can find equational laws as well as conditional equations. All
you need to supply are the functions to test, as well as
Arbitrary instances for QuickSpec to use in testing; the rest is
For information on how to use QuickSpec, see the documentation in the main
module, QuickSpec. You can also look in the
directory, for example at
To read about how
QuickSpec works, see our paper,
Quick specifications for the busy programmer.
[Skip to Readme]
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees