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

Yampa -FRP.Yampa.Miscellany  FRP.Yampa  

<div class="warning"><p>Deprecated: Use Control.Arrow.(>>>) and Control.Arrow.(<<<).</p></div>
lexp :: (a -> b) -> (b -> c) -> a -> c

pointless-haskell -Generics.Pointless.Combinators  

<p>The left exponentiation combinator.</p>
(|>) :: (a -> b) -> (b -> c) -> a -> c

hx -Haskell.X.Ops  

<p><code>flip (.)</code>, fixity is <code>infixl 9</code> (same as for <code>.</code>), from F#. </p>
(.>) :: (a -> b) -> (b -> c) -> a -> c

flow -Flow  

<pre>(f .> g) x == g (f x)</pre><pre>(f .> g .> h) x == h (g (f x))</pre><p>Left-associative <code><a href="/?query=%28%28name%3A%28%21compose%29%20package%3A%28%21flow%29%20module%3A%28%21Flow%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21compose%29%20package%3A%28%21flow%29%29%5E10.0%29%20OR%20name%3A%28%21compose%29">compose</a></code> operator. This is like a flipped version of the <code><a href="/?query=%28%28name%3A%28%21.%29%20package%3A%28%21base%29%20module%3A%28%21Prelude%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21.%29%20package%3A%28%21base%29%29%5E10.0%29%20OR%20name%3A%28%21.%29">.</a></code> operator. Read it as "compose forward" or "and then".</p><pre class="screen"><code class="prompt">>>> </code><strong class="userinput"><code>(not .> fromEnum) False </code></strong>1 </pre><p>Thanks to its high precedence, composing many functions together is easy.</p><pre class="screen"><code class="prompt">>>> </code><strong class="userinput"><code>(not .> fromEnum .> succ) False </code></strong>2 </pre>
compose :: (a -> b) -> (b -> c) -> a -> c

flow -Flow  

<pre>compose f g x == g (f x)</pre><p><a href="">Function composition</a>. This is like the <code><a href="/?query=%28%28name%3A%28%21.%29%20package%3A%28%21base%29%20module%3A%28%21Prelude%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21.%29%20package%3A%28%21base%29%29%5E10.0%29%20OR%20name%3A%28%21.%29">.</a></code> operator.</p><pre class="screen"><code class="prompt">>>> </code><strong class="userinput"><code>(compose not fromEnum) False </code></strong>1 </pre><p>Composing many functions together quickly becomes unwieldy. Use <code><a href="/?query=%28%28name%3A%28%21.%3E%29%20package%3A%28%21flow%29%20module%3A%28%21Flow%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21.%3E%29%20package%3A%28%21flow%29%29%5E10.0%29%20OR%20name%3A%28%21.%3E%29">.></a></code> or <code><a href="/?query=%28%28name%3A%28%21%3C.%29%20package%3A%28%21flow%29%20module%3A%28%21Flow%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21%3C.%29%20package%3A%28%21flow%29%29%5E10.0%29%20OR%20name%3A%28%21%3C.%29"><.</a></code> instead.</p><pre class="screen"><code class="prompt">>>> </code><strong class="userinput"><code>(not `compose` fromEnum `compose` succ) False </code></strong>2 </pre>
(.>) :: (a -> b) -> (b -> c) -> a -> c

functor-monadic -Data.Functor.Monadic  

<p>Flipped version <code><a href="/?query=%28%28name%3A%28%21.%29%20package%3A%28%21base%29%20module%3A%28%21Prelude%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21.%29%20package%3A%28%21base%29%29%5E10.0%29%20OR%20name%3A%28%21.%29">.</a></code>. </p>
withCont :: ((b -> r) -> a -> r) -> Cont r a -> Cont r b

transformers -Control.Monad.Trans.Cont  

<p>Apply a function to transform the continuation passed to a CPS computation.</p><ul><li><pre><code><a href="/?query=%28%28name%3A%28%21runCont%29%20package%3A%28%21transformers%29%20module%3A%28%21Control.Monad.Trans.Cont%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21runCont%29%20package%3A%28%21transformers%29%29%5E10.0%29%20OR%20name%3A%28%21runCont%29">runCont</a></code> (<code><a href="/?query=%28%28name%3A%28%21withCont%29%20package%3A%28%21transformers%29%20module%3A%28%21Control.Monad.Trans.Cont%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21withCont%29%20package%3A%28%21transformers%29%29%5E10.0%29%20OR%20name%3A%28%21withCont%29">withCont</a></code> f m) = <code><a href="/?query=%28%28name%3A%28%21runCont%29%20package%3A%28%21transformers%29%20module%3A%28%21Control.Monad.Trans.Cont%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21runCont%29%20package%3A%28%21transformers%29%29%5E10.0%29%20OR%20name%3A%28%21runCont%29">runCont</a></code> m . f</pre></li></ul>
(#) :: (a -> b) -> (b -> c) -> a -> c

Animas -FRP.Animas.Miscellany  FRP.Animas  

<p>Reverse composition </p>
(<&>) :: (a -> b) -> (b -> c) -> a -> c

acme-cadre -Acme.Cadre  

<p><code>(<&>) = flip (.)</code>. Hide this if you are importing <code><&></code> from <a href="">Control.Lens</a>. </p>
queer :: (a -> b) -> (b -> c) -> a -> c

data-aviary -Data.Aviary.Birds  

<p>Q combinator - queer bird. </p><p>Haskell <code>(##)</code> in Peter Thiemann's Wash, reverse composition. </p>
queer :: (a -> b) -> (b -> c) -> a -> c

data-aviary -Data.Aviary.BirdsInter  

<p>Q combinator - queer bird. </p><p>Haskell <code>(##)</code> in Peter Thiemann's Wash, reverse composition. </p>
queer :: (r1 -> a) -> (a -> ans) -> r1 -> ans

data-aviary -Data.Aviary.BirdsVersion  

<p>Q combinator - queer bird. </p><p>Haskell <code>(##)</code> in Peter Thiemann's Wash, reverse composition. </p>
(>>>) :: (a -> b) -> (b -> c) -> a -> c

data-aviary -Data.Aviary.Functional  

<p>For the function instance of Category left-to-right composition is the <code><a href="/?query=%28%28name%3A%28%21queer%29%20package%3A%28%21data-aviary%29%20module%3A%28%21Data.Aviary.Birds%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21queer%29%20package%3A%28%21data-aviary%29%29%5E10.0%29%20OR%20name%3A%28%21queer%29">queer</a></code> bird. </p>
(>>^) :: (b -> c) -> (c -> d) -> b -> d

data-aviary -Data.Aviary.Functional  

<p>The Arrow operation <em>postcomposition with a pure function</em> (left-to-right) is equal to the left-to-right composition operator (<code><a href="/?query=%28%28name%3A%28%21%3E%3E%3E%29%20package%3A%28%21data-aviary%29%20module%3A%28%21Data.Aviary.Functional%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21%3E%3E%3E%29%20package%3A%28%21data-aviary%29%29%5E10.0%29%20OR%20name%3A%28%21%3E%3E%3E%29">>>></a></code>) for function Arrows. </p><p>This corresponds to <code><a href="/?query=%28%28name%3A%28%21queer%29%20package%3A%28%21data-aviary%29%20module%3A%28%21Data.Aviary.Birds%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21queer%29%20package%3A%28%21data-aviary%29%29%5E10.0%29%20OR%20name%3A%28%21queer%29">queer</a></code>. </p>
(^>>) :: (b -> c) -> (c -> d) -> b -> d

data-aviary -Data.Aviary.Functional  

<p>The Arrow operation <em>precomposition with a pure function</em> (left-to-right) is equal to the left-to-right composition operator (<code><a href="/?query=%28%28name%3A%28%21%3E%3E%3E%29%20package%3A%28%21data-aviary%29%20module%3A%28%21Data.Aviary.Functional%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21%3E%3E%3E%29%20package%3A%28%21data-aviary%29%29%5E10.0%29%20OR%20name%3A%28%21%3E%3E%3E%29">>>></a></code>) for function Arrows. </p><p>This corresponds to <code><a href="/?query=%28%28name%3A%28%21queer%29%20package%3A%28%21data-aviary%29%20module%3A%28%21Data.Aviary.Birds%29%29%5E100.0%29%20OR%20%28%28name%3A%28%21queer%29%20package%3A%28%21data-aviary%29%29%5E10.0%29%20OR%20name%3A%28%21queer%29">queer</a></code>. </p>