úÎ!”%                  ! "#$Safe+%&'()*+,Safe‚Safeîabides(f  | g)  * x == (f  * x)  | (g  | x)abidesempty  * x == emptySafeSXLSafe’SafeØSafe&  SafeabidesminBound <= x <= maxBound?Safeabides0compare x y == compare (fromEnum x) (fromEnum y)abidespred (succ x) == xabidessucc (pred x) == xSafeæabidesfold (map f x) == foldMap f x Safe 4abidesfmap 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 Safeabidesx == 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)?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? Safe‚ SafeÀ ! !Safep"abidesx == y => y == x?#abidesx == y && y == z => x == z$abidesx /= y => not (x == y)"#$"#$-        !  " #   $%&'()*+,-.#abides-0.0.0-EMpqj97jV5pDcL7QHrEjvSTest.Abides.Control.AlternativeTest.Abides.Control.ApplicativeTest.Abides.Control.CategoryTest.Abides.Control.ComonadTest.Abides.Control.MonadTest.Abides.Data.BoundedTest.Abides.Data.EnumTest.Abides.Data.FoldableTest.Abides.Data.FunctorTest.Abides.Data.OrdTest.Abides.PropertiesTest.Abides.Data.SemigroupTest.Abides.Data.MonoidTest.Abides.Data.Eq Paths_abides Test.Abides distributive annihilationidentity composition associative leftIdentity rightIdentitybounded compareHompredsuccsuccpredfoldMap' reflexive antisymmetry transitive commutative idempotentconstLconstRsymmetrynegationversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName