quickcheck-combinators

Simple type-level combinators for augmenting QuickCheck instances.

https://github.com/athanclark/quickcheck-combinators#readme

LTS Haskell 11.22:0.0.4
Stackage Nightly 2026-01-08:0.0.6
Latest on Hackage:0.0.6

See all snapshots quickcheck-combinators appears in

BSD-3-Clause licensed by Athan Clark
Maintained by [email protected]
This version can be pinned in stack with:quickcheck-combinators-0.0.6@sha256:49a68fd685edbb7d5828c2fde3ebccfbd7e65af0aaf3e04269840deee631b618,1261

Module documentation for 0.0.6

quickcheck-combinators

Simply wrap the type you want to generate (assuming it satisfies all the necessary constraints) to refine the terms generated:

{-# LANGUAGE DataKinds #-}

import Data.Set (Set)
import Test.QuickCheck
import Test.QuickCheck.Instances
import GHC.TypeLits

instance Arbitrary LinearEquation where
  arbitrary = do
    vars <- arbitrary :: Gen (AtLeast 3 Set String)
    -- ...