Hoogle Search
Within LTS Haskell 24.18 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
:+: ) :: 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.
-
quickcheck-higherorder Test.QuickCheck.HigherOrder.Internal.Testable No documentation available.
(
:==> ) :: a -> b -> Implication a bquickcheck-higherorder Test.QuickCheck.HigherOrder.Internal.Testable No documentation available.
type family (x :: [k])
:++ (y :: [k]) :: [k]registry Data.Registry.Solver Extracted from the typelevel-sets project and adapted for the Registry datatype This union deduplicates elements only if they appear in contiguously What we really want is typelevel sets but they are too slow for now https://github.com/dorchard/type-level-sets/issues/17