HORIZON HASKELLDocslts/ghc-9.10.x248f8f02026-10-05Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · 248f8f0 · 2026-10-05

Modulesmallcheck-1.2.1.1Haskell2010

Test.SmallCheck

This module exports the main pieces of SmallCheck functionality.

To generate test cases for your own types, refer to Test.SmallCheck.Series.

For pointers to other sources of information about SmallCheck, please refer to the README at https://github.com/Bodigrim/smallcheck/blob/master/README.md

  • 3 types
  • 1 class
  • 9 values
  • Packagesmallcheck-1.2.1.1
  • Exports13
  • LanguageHaskell2010
  • LicenceBSD-3-Clause
  • SourceSmallCheck.hs

Constructing tests

0 declarations

The simplest kind of test is a function (possibly of many arguments) returning Bool. The function arguments are interpreted as being universally, existentially or uniquely quantified, depending on the quantification context.

The default quantification context is universal (forAll).

forAll, exists and existsUnique functions set the quantification context for function arguments. Depending on the quantification context, the test \x y -> p x y may be equivalent to:

  • \forall x, y\colon p\, x \, y (forAll),

  • \exists x, y\colon p\, x \, y (exists),

  • \exists! x, y\colon p\, x \, y (existsUnique).

The quantification context affects all the variables immediately following the quantification operator, also extending past over, changeDepth and changeDepth1 functions.

However, it doesn't extend past other functions, like monadic, and doesn't affect the operands of ==>. Such functions start a fresh default quantification context.

Examples

  • \x y -> p x y means \forall x, y\colon p\, x \, y .

  • exists $ \x y -> p x y means \exists x, y\colon p\, x \, y .

  • exists $ \x -> forAll $ \y -> p x y means \exists x\colon \forall y\colon p \, x \, y .

  • existsUnique $ \x y -> p x y means \exists! x, y\colon p\, x \, y .

  • existsUnique $ \x -> over s $ \y -> p x y means \exists! x, y \colon y \in s \wedge p \, x \, y .

  • existsUnique $ \x -> monadic $ \y -> p x y means \exists! x \colon \forall y \colon [p \, x \, y] .

  • existsUnique $ \x -> existsUnique $ \y -> p x y means \exists! x \colon \exists! y \colon p \, x \, y .

  • exists $ \x -> (\y -> p y) ==> (\z -> q z) means \exists x \colon (\forall y\colon p\, y) \implies (\forall z\colon q\, z) .

valueexistsUnique :: Testable m a => a -> Property m
#

Set the uniqueness quantification context.

Bear in mind that \exists! x, y\colon p\, x \, y is not the same as \exists! x \colon \exists! y \colon p \, x \, y .

For example, \exists! x \colon \exists! y \colon |x| = |y| is true (it holds only when x=y=0), but \exists! x, y \colon |x| = |y| is false (there are many such pairs).

As is customary in mathematics, existsUnique $ \x y -> p x y is equivalent to existsUnique $ \(x, y) -> p x y and not to existsUnique $ \x -> existsUnique $ \y -> p x y (the latter, of course, may be explicitly written when desired).

That is, all the variables affected by the same uniqueness context are quantified simultaneously as a tuple.

valueover :: (Show a, Testable m b) => Series m a -> (a -> b) -> Property m
#

over s $ \x -> p x makes x range over the Series s (by default, all variables range over the series for their types).

Note that, unlike the quantification operators, this affects only the variable following the operator and not subsequent variables.

over does not affect the quantification context.

value(==>) :: (Testable m c, Testable m a) => c -> a -> Property m
#

The ==> operator can be used to express a restricting condition under which a property should hold. It corresponds to implication in the classical logic.

Note that ==> resets the quantification context for its operands to the default (universal).

Running tests

2 declarations

smallCheck is a simple way to run a test.

As an alternative, consider using a testing framework.

The packages http://hackage.haskell.org/package/tasty-smallcheck and http://hackage.haskell.org/package/hspec-smallcheck provide integration with Tasty and HSpec, two popular testing frameworks.

They allow to organize SmallCheck properties into a test suite (possibly together with HUnit or QuickCheck tests) and provide other useful features.

For more ways to run the tests, see Test.SmallCheck.Drivers.

typetype Depth = Int
#

Maximum depth of generated test values.

For data values, it is the depth of nested constructor applications.

For functional values, it is both the depth of nested case analysis and the depth of results.

Main types and classes

3 declarations
classclass Monad m => Testable (m :: Type -> Type) a where
#

Class of tests that can be run in a monad. For pure tests, it is recommended to keep their types polymorphic in m rather than specialising it to Data.Functor.Identity.

Methods

Instances4Testable
newtypenewtype Property (m :: Type -> Type)
#

The type of properties over the monad m.

Instances1Testable
typetype Reason = String
#

An explanation for the test outcome.