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.

  1. (:+) :: a -> b -> (:+) a b

    scanf Text.Scanf.Internal

    No documentation available.

  2. (:<) :: a -> e -> LocatedBy a e

    sexp-grammar Language.Sexp.Located

    No documentation available.

  3. data h :- t

    sexp-grammar Language.SexpGrammar

    "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. (:-) :: forall (n1 :: Nat) a (f :: Type -> Type) . (KnownNat n1, KnownNat (1 + n1)) => a -> Sized f n1 a -> ConsView f (1 + n1) a

    sized Data.Sized

    No documentation available.

  5. (:-::) :: forall (n1 :: Nat) (f :: Type -> Type) a . KnownNat n1 => Sized f n1 a -> a -> SnocView f (n1 + 1) a

    sized Data.Sized

    No documentation available.

  6. pattern (:<) :: (Dom f a, KnownNat n, CFreeMonoid f) => (n ~ (1 + n1), KnownNat n1) => a -> Sized f n1 a -> Sized f n a

    sized Data.Sized

    Pattern synonym for cons-side uncons.

  7. pattern (:>) :: (Dom f a, KnownNat n, CFreeMonoid f) => (n ~ (n1 + 1), KnownNat n1) => Sized f n1 a -> a -> Sized f n a

    sized Data.Sized

    Pattern synonym for snoc-side unsnoc.

  8. (:==:) :: Pattern -> Pattern -> Rule

    srtree Algorithm.EqSat.DB

    No documentation available.

  9. (:=>) :: Pattern -> Pattern -> Rule

    srtree Algorithm.EqSat.DB

    No documentation available.

  10. (:|) :: Rule -> Condition -> Rule

    srtree Algorithm.EqSat.DB

    No documentation available.

Page 65 of many | Previous | Next