Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
invertible-grammar Data.InvertibleGrammar "Cons" pair of a heterogenous list or a stack with potentially polymophic tail. E.g. "first" :- 2 :- (3,4) :- t Isomorphic to a tuple with two elments, but is much more convenient for nested pairs.
-
invertible-grammar Data.InvertibleGrammar.Base "Cons" pair of a heterogenous list or a stack with potentially polymophic tail. E.g. "first" :- 2 :- (3,4) :- t Isomorphic to a tuple with two elments, but is much more convenient for nested pairs.
-
invertible-grammar Data.InvertibleGrammar.Base No documentation available.
(
:.: ) :: forall p b1 b a . Grammar p b1 b -> Grammar p a b1 -> Grammar p a binvertible-grammar Data.InvertibleGrammar.Base Grammar composition.
(
:<>: ) :: forall p a b . Grammar p a b -> Grammar p a b -> Grammar p a binvertible-grammar Data.InvertibleGrammar.Base Grammar alternation. Left operand is tried first.
(
:&&: ) :: forall k1 ks . k1 -> LoT ks -> LoT (k1 -> ks)kind-apply Data.PolyKinded Cons a type with a list of types.
type family (f :: k)
:@@: (tys :: LoT k)kind-apply Data.PolyKinded Apply a list of types to a type constructor.
>>> :kind! Either :@@: (Int :&&: Bool :&&: LoT0) Either :@@: (Int :&&: Bool :&&: LoT0) :: Type = Either Int Bool
(
:&: ) :: forall d . Atom d Constraint -> Atom d Constraint -> Atom d Constraintkind-apply Data.PolyKinded.Atom Represents the conjunction of two constraints.
(
:=>>: ) :: forall d . Atom d Constraint -> Atom d Type -> Atom d Typekind-apply Data.PolyKinded.Atom Represents constraint requirement, the "thick arrow" =>.
(
:@: ) :: forall d k1 k2 . Atom d (k1 -> k2) -> Atom d k1 -> Atom d k2kind-apply Data.PolyKinded.Atom Represents type application.