Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

  1. testEqualityComposeBare :: forall k l f (g :: l -> k) (x :: l) (y :: l) . (forall (w :: k) (z :: k) . () => f w -> f z -> Maybe (w :~: z)) -> Compose f g x -> Compose f g y -> Maybe (x :~: y)

    parameterized-utils Data.Parameterized.Compose

    The deduction (via generativity) that if g x :~: g y then x :~: y. See https://gitlab.haskell.org/ghc/ghc/merge_requests/273.

  2. module Data.Parameterized.DecidableEq

    This defines a class DecidableEq, which represents decidable equality on a type family. This is different from GHC's TestEquality in that it provides evidence of non-equality. In fact, it is a superclass of TestEquality.

  3. class DecidableEq (f :: k -> Type)

    parameterized-utils Data.Parameterized.DecidableEq

    Decidable equality.

  4. decEq :: forall (a :: k) (b :: k) . DecidableEq f => f a -> f b -> Either (a :~: b) ((a :~: b) -> Void)

    parameterized-utils Data.Parameterized.DecidableEq

    No documentation available.

  5. data UpdateRequest v

    parameterized-utils Data.Parameterized.Map

    UpdateRequest tells what to do with a found value

  6. data LeqProof (m :: Nat) (n :: Nat)

    parameterized-utils Data.Parameterized.NatRepr

    LeqProof m n is a type whose values are only inhabited when m is less than or equal to n.

  7. NatCaseEQ :: forall (m :: Natural) . NatCases m m

    parameterized-utils Data.Parameterized.NatRepr

    No documentation available.

  8. NatEQ :: forall (m :: Natural) . NatComparison m m

    parameterized-utils Data.Parameterized.NatRepr

    No documentation available.

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

    parameterized-utils Data.Parameterized.NatRepr

    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.

  10. addIsLeq :: forall f (n :: Nat) g (m :: Natural) . f n -> g m -> LeqProof n (n + m)

    parameterized-utils Data.Parameterized.NatRepr

    No documentation available.

Page 378 of many | Previous | Next