Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()

    numhask NumHask.Prelude

    Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequence. sequence_ is just like sequenceA_, but specialised to monadic actions.

  2. class TestEquality (f :: k -> Type)

    parameterized-utils Data.Parameterized.BoolRepr

    This class contains types where you can learn the equality of two types from information contained in terms. The result should be Just Refl if and only if the types applied to f are equal:

    testEquality (x :: f a) (y :: f b) = Just Refl ⟺ a = b
    
    Typically, only singleton types should inhabit this class. In that case type argument equality coincides with term equality:
    testEquality (x :: f a) (y :: f b) = Just Refl ⟺ a = b ⟺ x = y
    
    isJust (testEquality x y) = x == y
    
    Singleton types are not required, however, and so the latter two would-be laws are not in fact valid in general.

  3. testEquality :: forall (a :: k) (b :: k) . TestEquality f => f a -> f b -> Maybe (a :~: b)

    parameterized-utils Data.Parameterized.BoolRepr

    Conditionally prove the equality of a and b.

  4. class PolyEq u v

    parameterized-utils Data.Parameterized.Classes

    A polymorphic equality operator that generalizes TestEquality.

  5. class TestEquality (f :: k -> Type)

    parameterized-utils Data.Parameterized.Classes

    This class contains types where you can learn the equality of two types from information contained in terms. The result should be Just Refl if and only if the types applied to f are equal:

    testEquality (x :: f a) (y :: f b) = Just Refl ⟺ a = b
    
    Typically, only singleton types should inhabit this class. In that case type argument equality coincides with term equality:
    testEquality (x :: f a) (y :: f b) = Just Refl ⟺ a = b ⟺ x = y
    
    isJust (testEquality x y) = x == y
    
    Singleton types are not required, however, and so the latter two would-be laws are not in fact valid in general.

  6. geqF :: forall (x :: k) (y :: k) . OrdF ktp => ktp x -> ktp y -> Bool

    parameterized-utils Data.Parameterized.Classes

    No documentation available.

  7. leqF :: forall (x :: k) (y :: k) . OrdF ktp => ktp x -> ktp y -> Bool

    parameterized-utils Data.Parameterized.Classes

    No documentation available.

  8. polyEq :: PolyEq u v => u -> v -> Bool

    parameterized-utils Data.Parameterized.Classes

    No documentation available.

  9. polyEqF :: PolyEq u v => u -> v -> Maybe (u :~: v)

    parameterized-utils Data.Parameterized.Classes

    No documentation available.

  10. testEquality :: forall (a :: k) (b :: k) . TestEquality f => f a -> f b -> Maybe (a :~: b)

    parameterized-utils Data.Parameterized.Classes

    Conditionally prove the equality of a and b.

Page 377 of many | Previous | Next