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. 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.

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

    parameterized-utils Data.Parameterized.NatRepr

    No documentation available.

  3. addIsLeqLeft1 :: forall (n :: Natural) (n' :: Natural) (m :: Nat) . LeqProof (n + n') m -> LeqProof n m

    parameterized-utils Data.Parameterized.NatRepr

    No documentation available.

  4. addPrefixIsLeq :: forall f (m :: Natural) g (n :: Nat) . f m -> g n -> LeqProof n (m + n)

    parameterized-utils Data.Parameterized.NatRepr

    No documentation available.

  5. decideLeq :: forall (a :: Nat) (b :: Nat) . NatRepr a -> NatRepr b -> Either (LeqProof a b) (LeqProof a b -> Void)

    parameterized-utils Data.Parameterized.NatRepr

    (<=) is a decidable relation on nats.

  6. leqAdd :: forall f (m :: Nat) (n :: Nat) (p :: Natural) . LeqProof m n -> f p -> LeqProof m (n + p)

    parameterized-utils Data.Parameterized.NatRepr

    Produce proof that adding a value to the larger element in an LeqProof is larger

  7. leqAdd2 :: forall (x_l :: Nat) (x_h :: Nat) (y_l :: Nat) (y_h :: Nat) . LeqProof x_l x_h -> LeqProof y_l y_h -> LeqProof (x_l + y_l) (x_h + y_h)

    parameterized-utils Data.Parameterized.NatRepr

    Add both sides of two inequalities

  8. leqAddPos :: forall (m :: Natural) (n :: Natural) p q . (1 <= m, 1 <= n) => p m -> q n -> LeqProof 1 (m + n)

    parameterized-utils Data.Parameterized.NatRepr

    No documentation available.

  9. leqMulCongr :: forall (a :: Nat) (x :: Nat) (b :: Nat) (y :: Nat) . LeqProof a x -> LeqProof b y -> LeqProof (a * b) (x * y)

    parameterized-utils Data.Parameterized.NatRepr

    Congruence rule for multiplication

  10. leqMulPos :: forall p q (x :: Natural) (y :: Natural) . (1 <= x, 1 <= y) => p x -> q y -> LeqProof 1 (x * y)

    parameterized-utils Data.Parameterized.NatRepr

    Multiplying two positive numbers results in a positive number.

Page 379 of many | Previous | Next