Automatic testing of Haskell programs
|Version on this page:||2.8.2|
|LTS Haskell 20.23:||2.14.2|
|Stackage Nightly 2023-05-31:||2.14.2|
|Latest on Hackage:||2.14.3|
Maintained by QuickCheck developers
This version can be pinned in stack with:
Module documentation for 2.8.2
Depends on 6 packages(full list with versions):
Used by 63 packages in lts-6.35(full list with versions):
Agda, alex, b9, carray, ChasingBottoms, checkers, chell-quickcheck, clash-prelude, compdata, crypto-api-tests, crypto-cipher-tests, cryptol, digits, EdisonCore, FenwickTree, fgl-arbitrary, fuzzcheck, genvalidity, genvalidity-hspec, git-annex, HaTeX, hbayes, HCodecs, holy-project, hoogle, hPDB, hspec, hspec-core, hspec-meta, hspec-wai, HTF, inline-c, jose, lambdacube-compiler, language-ecmascript, language-nix, mandrill, Octree, permutation, pred-trie, and many more
QuickCheck is a library for random testing of program properties.
The programmer provides a specification of the program, in the form of properties which functions should satisfy, and QuickCheck then tests that the properties hold in a large number of randomly generated cases.
Specifications are expressed in Haskell, using combinators defined in the QuickCheck library. QuickCheck provides combinators to define properties, observe the distribution of test data, and define test data generators.
You can find a (slightly out-of-date but useful) manual at http://www.cse.chalmers.se/~rjmh/QuickCheck/manual.html.