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.

Exact lookup

1. (:<->:) :: a b c -> a c b -> Bijection (a :: Type -> Type -> Type) b c

   invertible	Control.Invertible.Monoidal

   No documentation available.

2. (:<->:) :: a b c -> a c b -> Bijection (a :: Type -> Type -> Type) b c

   invertible	Data.Invertible.Bijection

   No documentation available.

3. data h :- t

   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.

4. data h :- t

   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.

5. (:-) :: h -> t -> (:-) h t

   invertible-grammar	Data.InvertibleGrammar.Base

   No documentation available.

6. (:.:) :: forall p b1 b a . Grammar p b1 b -> Grammar p a b1 -> Grammar p a b

   invertible-grammar	Data.InvertibleGrammar.Base

   Grammar composition.

7. (:<>:) :: forall p a b . Grammar p a b -> Grammar p a b -> Grammar p a b

   invertible-grammar	Data.InvertibleGrammar.Base

   Grammar alternation. Left operand is tried first.

8. (:&&:) :: forall k1 ks . k1 -> LoT ks -> LoT (k1 -> ks)

   kind-apply	Data.PolyKinded

   Cons a type with a list of types.

9. 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
   

10. (:&:) :: forall d . Atom d Constraint -> Atom d Constraint -> Atom d Constraint

    kind-apply	Data.PolyKinded.Atom

    Represents the conjunction of two constraints.

Page 56 of many | Previous | Next