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.
-
monoid-extras Data.Monoid.MList No documentation available.
-
monoid-extras Data.Monoid.MList The relation l :>: a holds when a is the type of an element in l. For example, (Char ::: Int ::: Bool ::: Nil) :>: Int.
-
monoid-extras Data.Monoid.Split No documentation available.
-
monoid-extras Data.Semigroup.Coproduct m :+. n is the coproduct of semigroups m and n. Values of type m :+. n consist of alternating non-empty lists of m and n values. Composition is list concatenation, with appropriate combining of adjacent elements
-
numeric-prelude Number.Ratio No documentation available.
-
numhask NumHask No documentation available.
-
numhask NumHask.Data.Rational No documentation available.
-
parameterized-utils Data.Parameterized.BoolRepr Propositional equality. If a :~: b is inhabited by some terminating value, then the type a is the same as the type b. To use this equality in practice, pattern-match on the a :~: b to get out the Refl constructor; in the body of the pattern-match, the compiler knows that a ~ b.
-
parameterized-utils Data.Parameterized.Classes Propositional equality. If a :~: b is inhabited by some terminating value, then the type a is the same as the type b. To use this equality in practice, pattern-match on the a :~: b to get out the Refl constructor; in the body of the pattern-match, the compiler knows that a ~ b.
-
parameterized-utils Data.Parameterized.Context No documentation available.