Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. dividesPlus :: forall (a :: Nat) (b :: Nat) (c :: Nat) . (Divides a b, Divides a c) :- Divides a (b + c)

   constraints	Data.Constraint.Nat

   No documentation available.

2. dividesPow :: forall (n :: Natural) (a :: Nat) (b :: Nat) . (1 <= n, Divides a b) :- Divides a (b ^ n)

   constraints	Data.Constraint.Nat

   No documentation available.

3. dividesTimes :: forall (a :: Nat) (b :: Nat) (c :: Natural) . Divides a b :- Divides a (b * c)

   constraints	Data.Constraint.Nat

   No documentation available.

4. euclideanNat :: forall (c :: Natural) (a :: Natural) . (1 <= c) :- (a ~ ((c * Div a c) + Mod a c))

   constraints	Data.Constraint.Nat

   No documentation available.

5. gcdIsIdempotent :: forall (n :: Nat) . Dict (Gcd n n ~ n)

   constraints	Data.Constraint.Nat

   No documentation available.

6. lcmIsIdempotent :: forall (n :: Nat) . Dict (Lcm n n ~ n)

   constraints	Data.Constraint.Nat

   No documentation available.

7. leId :: forall (a :: Nat) . Dict (a <= a)

   constraints	Data.Constraint.Nat

   No documentation available.

8. maxIsIdempotent :: forall (n :: Nat) . Dict (Max n n ~ n)

   constraints	Data.Constraint.Nat

   No documentation available.

9. minIsIdempotent :: forall (n :: Nat) . Dict (Min n n ~ n)

   constraints	Data.Constraint.Nat

   No documentation available.

10. package uuid

    For creating, comparing, parsing and printing Universally Unique Identifiers This library is useful for creating, comparing, parsing and printing Universally Unique Identifiers. See http://en.wikipedia.org/wiki/UUID for the general idea.

Page 607 of many | Previous | Next