ogm|      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRS T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z {   Safe-Infered|}|}|} Safe-Infered~~ Safe-Infered?Generates a 2-tuple using its arguments to generate the parts. ?Generates a 3-tuple using its arguments to generate the parts. ?Generates a 4-tuple using its arguments to generate the parts. ?Generates a 5-tuple using its arguments to generate the parts.  Safe-Infered Safe-Infered      Safe-Infered     Safe-Infered AGenerates a non-empty list with the contents generated using its  argument. FGenerates any list (possibly empty) with the contents generated using  its argument. FGenerates an infinite list with contents generated using its argument #Generates a list with a set length %Generate increasing towards infinity /Generate an infinite list of increasing values Generate nondecreasing values 2Generate an infinite list of nondecreasing values %Generate increasing towards infinity /Generate an infinite list of increasing values Generate nondecreasing values 2Generate an infinite list of nondecreasing values     Safe-Inferedportable experimentallibraries@haskell.org Safe-Infered     experimentalconal@conal.netNone$!Like #" but for unary type constructors. % Explicit  dictionary. Doesn't have to correspond to an  actual  instance, though see D. 'ATypes of values that can be tested for equality, perhaps through  random sampling. )#Token uninteresting type for tests *Token  type for tests +Token  type for tests ,Token  type for tests -,Binary function, handy for type annotations .+Unary function, handy for type annotations /Named batch of tests 0 Named test 1.Flatten a test batch for inclusion in another 2Run a batch of tests. See 3 and 4. 3Check a batch tersely. 4Check a batch verbosely. 6f is a left inverse of g . See also 7. 7f is a left and right inverse of g . See also 6. 8For  types as ' types :Reflexive property: a rel a ;Transitive property: a rel b && b rel c ==> a rel c.  Generate a randomly, but use gen a to generate b and gen b to  generate c. gen ought to satisfy rel fairly often. <Symmetric property: a rel b ==> b rel a . Generate a  randomly, but use gen a to generate b. gen ought to satisfy  rel fairly often. =Symmetric property: a rel b && b rel a ==> a == b . Generate  a randomly, but use gen a to generate b. gen ought to satisfy  both rel) directions fairly often but not always. >(Has a given left identity, according to '(=-=)' ?)Has a given right identity, according to '(=-=)' @2Has a given left and right identity, according to '(=-=)' AAssociative, according to '(=-=)' BCommutative, according to '(=-=)' CCommutative, according to '(=-=)' D dictionary built from the  methods. E;Monoid dictionary for an unwrapped endomorphism. See also D  and . FCHomomorphism properties with respect to given monoid dictionaries.  See also monoidMorphism. GThe unary function f is idempotent, i.e.,  f . f == f HA binary function op is idempotent, i.e., x op x == x , for all x IA binary function op is has an idempotent element x, i.e.,  x op x == x QGenerate n arbitrary values R"Produce n values from a generator G!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR3!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR30/1234.-567,+*)'(8&:;<=>?@ACB%DEFGHI#$JKLMNO9!"QRPD!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR  Safe-InferedSTSTSTST  Safe-Infered U Generates a ' non space'" character, i.e. any ascii except  ' ', '\t', '\n' and '\r'. V9Generates any whitespace character, including new lines. W1Generates a whitespace charecter, not a newline. XGenerates either a '\n' or '\r'. Y*Generates any lower case alpha character. Z*Generates any upper case alpha character. [Generates a digit character. \Generates one or other of '(' and ')'. ]Generates one or other of '[' and ']'. ^Generates one or other of '{' and '}'. _Generates one of , , , , , , '|' and '#'. UVWXYZ[\]^_ UVWXYZ[\]^_ UVWXYZ[\]^_ UVWXYZ[\]^_  experimentalconal@conal.net Safe-Infered`Total ordering. gen a ought to generate values b satisfying a  rel b fairly often. aTotal ordering b morphism properties. h is an  morphism iff:  a <= b = h a <= h b  " h (a `min` b) = h a `min` h b " h (a `max` b) = h a `max` h b cThe semantic function ($) for a is an b. dProperties to check that the  a satisfies the monoid H properties. The argument value is ignored and is present only for its  type. e*Monoid homomorphism properties. See also F. fThe semantic function ($) for a is a e. hProperties to check that the  m satisfies the functor  properties. i. morphism (natural transformation) properties jThe semantic function (") for f is a i. kProperties to check that the  m satisfies the monad  properties l morphism properties mThe semantic function (") for f is an l. nProperties to check that the  m satisfies the monad properties o*Law for monads that are also instances of . q morphism properties  morphism properties rThe semantic function (") for f is a q. s5Laws for MonadPlus instances with left distribution. t.Laws for MonadPlus instances with left catch. `abcdefghijklmnopqrstuvw`abcdefghijklmnopqrstuvw`abcdefhijgklmnqropuvwst`abcdefghijklmnopqrstuvw Safe-Infered& STUVWXYZ[\]^_  experimentaldavid@sankelsoftware.com Safe-InferedxDIs the given function commutative when restricted to the same value  but possibly different times? yDIs the given function associative when restricted to the same value  but possibly different times? z Delay a value'1s availability by the given duration in seconds. ; Note that the delay happens only on the first evaluation. {+A value that is never available. Rerun of hang from unamb, but ( replicated to avoid mutual dependency. DTODO: Remove when this module is moved into the unamb-test package. xyz{xyz{yxz{xyz{ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd e f g h i j k l m n o p q r s t u v w x y z { | } ~  checkers-0.2.9Test.QuickCheck.CheckersTest.QuickCheck.Instances.TupleTest.QuickCheck.Instances.OrdTest.QuickCheck.Instances.NumTest.QuickCheck.Instances.MaybeTest.QuickCheck.Instances.ListTest.QuickCheck.BottomsTest.QuickCheck.UtilsTest.QuickCheck.Instances.EqTest.QuickCheck.Instances.CharTest.QuickCheck.ClassesTest.QuickCheck.LaterControl.Monad.ExtensionsTest.QuickCheck.Instances.ArrayTest.QuickCheck.InstancesQuickCheck-2.4.2Test.QuickCheck.Property.&.>*<>**<>***<>****< greaterThanlessThan nonNegativepositive nonPositivenegativenonZerononZero_maybeGennonEmptyanyList infiniteList setLength increasing increasingInf nondecreasingnondecreasingInf decreasing decreasingInf nonincreasingnonincreasingInfbottom infiniteCompisAssociativeBy isAssociativeisCommutableBy isCommutable isTotalOrderModel1model1ModelmodelMonoidDBinRelEqProp=-=TOrdTNumTFracTBinopUnop TestBatchTestunbatch checkBatch quickBatch verboseBatchgenRinverseLinverseeqeqModels reflexive transitive symmetric antiSymmetricleftIdrightIdbothIdisAssoccommutesisCommutmonoidD endoMonoidD homomorphism idempotent idempotent2idemElemmeqmeq1meq2meq3meq4meq5arbitrarySatisfyingarbsgens notEqualTonotOneofnonSpace whitespacespacenewline lowerAlpha upperAlphanumeric parenthesisbracketbraceoperatorordRelord ordMorphism semanticOrdmonoidmonoidMorphismsemanticMonoid functorMonoidfunctorfunctorMorphismsemanticFunctor applicativeapplicativeMorphismsemanticApplicativemonad monadFunctormonadApplicative monadMorphism semanticMonad monadPlusmonadOrarrow arrowChoice traversable isCommutTimes isAssocTimesdelay delayForever satisfiesMif'$fCoArbitraryArray$fArbitraryArraybase Data.MonoidMonoidghc-prim GHC.ClassesOrdGHC.NumNumGHC.Real FractionalEqEndo $fTestable(,) $fTestable[] $fModel(,)(,) $fModel[][]$fModelDoubleDouble$fModelFloatFloat $fModelIntInt$fModelCharChar$fModelBoolBool $fEqProp(->)$fEqPropEither $fEqProp(,,,) $fEqProp(,,) $fEqProp(,) $fEqPropMaybe $fEqProp[]$fEqPropDouble $fEqPropFloat $fEqPropInt $fEqPropChar $fEqPropBool*/-+<>GHC.BaseFunctorControl.Applicative ApplicativeMonad