Automatic testing of Haskell programs


Version on this page:2.11.3
LTS Haskell 22.26:2.14.3
Stackage Nightly 2024-06-22:2.14.3
Latest on Hackage:

See all snapshots QuickCheck appears in

BSD-3-Clause licensed by Koen Claessen
Maintained by Nick Smallbone <[email protected]>; see also QuickCheck mailing list (https://groups.google.com/forum/#!forum/haskell-quickcheck)
This version can be pinned in stack with:QuickCheck-2.11.3@sha256:e4c56f52532c993fc4460aeac7a2543dc03a68fba36eff420f3294d4d2622416,5351

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.

The official QuickCheck manual explains how to write generators and properties; it is out-of-date in some details but still full of useful advice.

A user of QuickCheck has written an unofficial, but detailed, tutorial which you can find at https://begriffs.com/posts/2017-01-14-design-use-quickcheck.html.