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.
(
:*: ) :: f p -> g p -> (:*:) (f :: k -> Type) (g :: k -> Type) (p :: k)protolude Protolude No documentation available.
data ((f :: k -> Type)
:+: (g :: k -> Type)) (p :: k)protolude Protolude Sums: encode choice between constructors
newtype ((f :: k2 -> Type)
:.: (g :: k1 -> k2)) (p :: k1)protolude Protolude Composition of functors
(
:| ) :: a -> [a] -> NonEmpty aprotolude Protolude No documentation available.
-
protolude Protolude 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.
-
HaXml Text.XML.HaXml.Combinators No documentation available.
(
:= ) :: Label -> Value -> Fieldbson Data.Bson No documentation available.
-
jsaddle Data.JSString.Internal.Fusion.Types No documentation available.
-
monoid-extras Data.Monoid.Coproduct m :+: n is the coproduct of monoids m and n. Values of type m :+: n consist of alternating lists of m and n values. The empty list is the identity, and composition is list concatenation, with appropriate combining of adjacent elements and removing identities when possible.
-
monoid-extras Data.Monoid.Cut No documentation available.