Hoogle Search
Within LTS Haskell 24.65 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
neverIdentity :: Eq a => (a -> a) -> a -> Boolleancheck Test.LeanCheck.Utils.Operators Deprecated: Use isNeverIdentity.
commutativeMonoidLaws :: (Monoid a, Eq a, Arbitrary a, Show a) => Proxy a -> Lawsquickcheck-classes-base Test.QuickCheck.Classes.Base Tests the following properties:
- Commutative mappend a b ≡ mappend b a
monoidLaws :: (Monoid a, Eq a, Arbitrary a, Show a) => Proxy a -> Lawsquickcheck-classes-base Test.QuickCheck.Classes.Base Tests the following properties:
- Associative mappend a (mappend b c) ≡ mappend (mappend a b) c
- Left Identity mappend mempty a ≡ a
- Right Identity mappend a mempty ≡ a
- Concatenation mconcat as ≡ foldr mappend mempty as
semigroupMonoidLaws :: (Semigroup a, Monoid a, Eq a, Arbitrary a, Show a) => Proxy a -> Lawsquickcheck-classes-base Test.QuickCheck.Classes.Base No documentation available.
-
selective Control.Selective Selective instance for the standard applicative functor Validation. This is a good example of a non-trivial selective functor which is not a monad.
-
Defines the class SDecide, allowing for decidable equality over singletons.
-
singletons Data.Singletons.Decide Members of the SDecide "kind" class support decidable equality. Instances of this class are generated alongside singleton definitions for datatypes that derive an Eq instance.
-
singletons Data.Singletons.Decide Uninhabited data type
decideCoercion :: forall k (a :: k) (b :: k) . SDecide k => Sing a -> Sing b -> Maybe (Coercion a b)singletons Data.Singletons.Decide A suitable default implementation for testCoercion that leverages SDecide.
decideEquality :: forall k (a :: k) (b :: k) . SDecide k => Sing a -> Sing b -> Maybe (a :~: b)singletons Data.Singletons.Decide A suitable default implementation for testEquality that leverages SDecide.