(#) :: (a -> b) -> (b -> c) -> a -> c

Yampa -FRP.Yampa.Miscellany  FRP.Yampa  

Deprecated: Use Control.Arrow.(>>>) and Control.Arrow.(<<<).

lexp :: (a -> b) -> (b -> c) -> a -> c

pointless-haskell -Generics.Pointless.Combinators  

The left exponentiation combinator.

(|>) :: (a -> b) -> (b -> c) -> a -> c

hx -Haskell.X.Ops  

flip (.), fixity is infixl 9 (same as for .), from F#.

(.>) :: (a -> b) -> (b -> c) -> a -> c

flow -Flow  

(f .> g) x == g (f x)
(f .> g .> h) x == h (g (f x))

Left-associative compose operator. This is like a flipped version of the . operator. Read it as "compose forward" or "and then".

>>> (not .> fromEnum) False
1

Thanks to its high precedence, composing many functions together is easy.

>>> (not .> fromEnum .> succ) False
2
compose :: (a -> b) -> (b -> c) -> a -> c

flow -Flow  

compose f g x == g (f x)

Function composition. This is like the . operator.

>>> (compose not fromEnum) False
1

Composing many functions together quickly becomes unwieldy. Use .> or <. instead.

>>> (not `compose` fromEnum `compose` succ) False
2
(.>) :: (a -> b) -> (b -> c) -> a -> c

functor-monadic -Data.Functor.Monadic  

Flipped version ..

withCont :: ((b -> r) -> a -> r) -> Cont r a -> Cont r b

transformers -Control.Monad.Trans.Cont  

Apply a function to transform the continuation passed to a CPS computation.

(#) :: (a -> b) -> (b -> c) -> a -> c

Animas -FRP.Animas.Miscellany  FRP.Animas  

Reverse composition

(<&>) :: (a -> b) -> (b -> c) -> a -> c

acme-cadre -Acme.Cadre  

(<&>) = flip (.). Hide this if you are importing <&> from Control.Lens.

queer :: (a -> b) -> (b -> c) -> a -> c

data-aviary -Data.Aviary.Birds  

Q combinator - queer bird.

Haskell (##) in Peter Thiemann's Wash, reverse composition.

queer :: (a -> b) -> (b -> c) -> a -> c

data-aviary -Data.Aviary.BirdsInter  

Q combinator - queer bird.

Haskell (##) in Peter Thiemann's Wash, reverse composition.

queer :: (r1 -> a) -> (a -> ans) -> r1 -> ans

data-aviary -Data.Aviary.BirdsVersion  

Q combinator - queer bird.

Haskell (##) in Peter Thiemann's Wash, reverse composition.

(>>>) :: (a -> b) -> (b -> c) -> a -> c

data-aviary -Data.Aviary.Functional  

For the function instance of Category left-to-right composition is the queer bird.

(>>^) :: (b -> c) -> (c -> d) -> b -> d

data-aviary -Data.Aviary.Functional  

The Arrow operation postcomposition with a pure function (left-to-right) is equal to the left-to-right composition operator (>>>) for function Arrows.

This corresponds to queer.

(^>>) :: (b -> c) -> (c -> d) -> b -> d

data-aviary -Data.Aviary.Functional  

The Arrow operation precomposition with a pure function (left-to-right) is equal to the left-to-right composition operator (>>>) for function Arrows.

This corresponds to queer.