fact: Definition quickCheckWith {prop : Type} {_ : Checkable prop} (a : Args) (p : prop) : Result := let (rnd, computeFun) := match replay a with | Some (rnd, s) => (rnd, at0 (computeSize' a) s) | None => (newRandomSeed, computeSize' a) end in test (MkState (maxSuccess a) (maxDiscard a) (maxShrinks a) computeFun 0 0 (Map.empty nat) false rnd 0 0 (analysis a) ) (run (checker p)).
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrnat ssrbool eqtype div) ExtLib(Structures.Monad) SimpleIO(SimpleIO) QuickChick(RoseTrees RandomQC Generators Producer SemChecker) QuickChick(Show Checker State Classes) Coq.Strings.Ascii Coq.Strings.String List Recdef Arith.EqNat ZArith