# ¤ serCompF, >==<

## Types

serCompF :: F `a` `b` -> F `c` `a` -> F `c` `b`
>==< :: F `a` `b` -> F `c` `a` -> F `c` `b`
**infixr** 4 >==<

## Synopsis

serCompF fl fr

## Description

`serCompF`

connects the output of one fudget
to the input of another fudget, and can be seen as ordinary function
composition adapted for fudgets.
`>==<`

is an infix version of `serCompF`

.

### Input

Any input is passed to the right fudget.
### Output

Any output comes from the left fudget.

## Arguments

**fl** :: F `a` `b`

- left fudget
**fr** :: F `c` `a`

- right fudget

## See Also

Combinators with layout: >#==<.
Pre- and postprocessor combinators: >=^<, >^=<.

Parallel composition: >+<.

The corresponding stream processor combinators: serCompSP.