úÎ!ÚÐ/                       !"#$%&'()*+,-.Safe­/0123456SafeSXSafebSafe¨Safe€abidesminBound <= x <= maxBound?Safe¾Safe² abides0compare x y == compare (fromEnum x) (fromEnum y) abidespred (succ x) == x abidessucc (pred x) == x  Safe  SafeÔ abidesfold (map f x) == foldMap f x  Safe "abidesfmap id x == x?abides$fmap (f . g) x == fmap f (fmap g x)? Safe ²abidesx <= x?abidesx  = y && y <= x = x == yabidesx  = y && y <= z = x <= z Safe  SafeÒabidesx == x?abidesf x y == f y x?abidesf (f x y) z == f x (f y z)?abidesf (f x) == f x?abidesf (g x y) == g (f x) (f y)?abidesf (g x y) == g' (f x) (f y)?abides_f x y == x? Note: bottom ~ forall y. f bottom y == bottom, while unit ~ forall x. f x unit == xabides f x y == y? SafeH  Safe¦!!Safeä"#"#Safe”$abidesx == y => y == x?%abidesx == y && y == z => x == z&abidesx /= y => not (x == y)$%&$%&Safeê''Safe(()*+,()*+,Safe¼-abides(f  | g)  * x == (f  * x)  | (g  | x).abidesempty  * x == empty-.-.7   ! " # $ ! %  & ' ( ) * + , - . /0#1%/''/23456789:#abides-0.0.1-4inH0NoLkrsD4ZLjWadwqQTest.Abides.Control.ApplicativeTest.Abides.Control.CategoryTest.Abides.Control.ComonadTest.Abides.Data.BoundedTest.Abides.Data.DivisionRingTest.Abides.Data.EnumTest.Abides.Data.EuclideanRingTest.Abides.Data.FoldableTest.Abides.Data.FunctorTest.Abides.Data.OrdTest.Abides.Data.RingTest.Abides.PropertiesTest.Abides.Data.SemiringTest.Abides.Data.SemigroupTest.Abides.Data.MonoidTest.Abides.Data.Eq Test.Abides.Data.CommutativeRingTest.Abides.Control.MonadTest.Abides.Control.Alternative Paths_abidesidentity composition associative leftIdentity rightIdentityboundedinverse compareHompredsuccsuccpredintegralDomainfoldMap' reflexive antisymmetry transitiveadditiveInverse commutative idempotent distributive distributive'constLconstRcommutativeMonoidmonoidleftDistributiverightDistributive annihilationsymmetrynegationversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName