QuickCheck-safe

Safe reimplementation of QuickCheck's core

Version on this page:0.1.0.1@rev:3
LTS Haskell 3.22:0.1.0.1@rev:3
Stackage Nightly 2015-12-08:0.1.0.1@rev:3
Latest on Hackage:0.1.0.6@rev:1

See all snapshots QuickCheck-safe appears in

MIT licensed by Bertram Felgenhauer
Maintained by Bertram Felgenhauer
This version can be pinned in stack with:QuickCheck-safe-0.1.0.1@sha256:4e791ac9fa2f2e73029ab92d17e3ab93571ec5b1d5acda0ea1f340c5ee1346f6,1489

Module documentation for 0.1.0.1

Depends on 2 packages(full list with versions):
base, QuickCheck
Used by 1 package in lts-3.22(full list with versions):
lambdabot-trusted

QuickCheck-safe reimplements the quickCheck functionality with a pure interface and a very small trusted base (see Test.QuickCheck.Safe.Trusted).

  • uses the existing Arbitrary instances

  • implemented features: testing, result minimization (i.e., shrinking)

  • missing features: expected failures, label frequencies, coverage

The package is targeted at users who want to leverage SafeHaskell for sandboxing.

> putStr $ quickCheck (inventQCGen ()) (\x -> length (x :: [()]) < 10)
*** Failed! Falsifiable (after 18 tests and 3 shrinks):
[(),(),(),(),(),(),(),(),(),(),(),(),(),(),()]