quickspec: Equational laws for free!
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]
|Versions [RSS]||0.9, 0.9.1, 0.9.2, 0.9.3, 0.9.4, 0.9.5, 0.9.6, 2, 2.1, 2.1.1, 2.1.2, 2.1.3, 2.1.4, 2.1.5|
|Dependencies||base (>=4 && <5), constraints, containers, data-lens-light (>=0.1.1), dlist, QuickCheck (>=2.10), quickcheck-instances (>=0.3.16), random, spoon, template-haskell, transformers, twee-lib (==2.2), uglymemo [details]|
|Copyright||2009-2019 Nick Smallbone|
|Source repo||head: git clone git://github.com/nick8325/quickspec.git -b master|
|Uploaded||by NickSmallbone at 2020-08-31T13:19:44Z|
|Downloads||9014 total (12 in the last 30 days)|
|Rating||2.0 (votes: 2) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2020-08-31 [all 1 reports]