Hoogle Search
Within LTS Haskell 24.31 (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)linear-generics Generics.Linear No documentation available.
data ((f :: k -> Type)
:+: (g :: k -> Type)) (p :: k)linear-generics Generics.Linear Sums: encode choice between constructors
newtype ((f :: k2 -> Type)
:.: (g :: k1 -> k2)) (x :: k1)linear-generics Generics.Linear The composition operator for types. We use our own here because for many classes, it's possible to share generic deriving classes between GHC.Generics and Generics.Linear by just instantiating them for both composition operators (and MP1).
(
:+: ) :: forall x (xs :: [Type]) . x -> HList xs -> HList (x ': xs)multistate Data.HList.HList No documentation available.
newtype (f :: k -> Type)
:~> (g :: k -> Type)natural-transformation Control.Natural A natural transformation suitable for storing in a container.
(
:-> ) :: k -> v -> MapEntry k vprettyprinter-combinators Prettyprinter.Combinators No documentation available.
-
prim-uniq Data.Unique.Tag 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.
-
quickcheck-higherorder Test.QuickCheck.HigherOrder Testable representation of functions (a -> r). This representation supports random generation, shrinking, and printing, for property testing with QuickCheck or Hedgehog. Higher-order functions can be represented.
-
quickcheck-higherorder Test.QuickCheck.HigherOrder No documentation available.
(
:==> ) :: a -> b -> Implication a bquickcheck-higherorder Test.QuickCheck.HigherOrder No documentation available.