| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Fcf.Combinators
Description
General fcf combinators.
See also Fcf.Data.Function for more.
Synopsis
- data Pure (b :: a) (c :: a)
- data Pure1 (c :: a -> b) (d :: a) (e :: b)
- data Pure2 (d :: a -> b -> c) (e :: a) (f :: b) (g :: c)
- data Pure3 (e :: a -> b -> c -> d) (f :: a) (g :: b) (h :: c) (i :: d)
- data ((c :: a -> Exp b) =<< (d :: Exp a)) (e :: b)
- data ((c :: Exp a) >>= (d :: a -> Exp b)) (e :: b)
- data ((d :: b -> Exp c) <=< (e :: a -> Exp b)) (f :: a) (g :: c)
- type LiftM = (=<<) :: (a -> Exp b) -> Exp a -> b -> Type
- data LiftM2 (d :: a -> b -> Exp c) (e :: Exp a) (f :: Exp b) (g :: c)
- data LiftM3 (e :: a -> b -> c -> Exp d) (f :: Exp a) (g :: Exp b) (h :: Exp c) (i :: d)
- data Join (b :: Exp (Exp a)) (c :: a)
- data ((c :: a -> b) <$> (d :: Exp a)) (e :: b)
- data ((c :: Exp (a -> b)) <*> (d :: Exp a)) (e :: b)
- data Flip (d :: a -> b -> Exp c) (e :: b) (f :: a) (g :: c)
- data ConstFn (c :: a) (d :: b) (e :: a)
- data ((c :: a -> Exp b) $ (d :: a)) (e :: b)