compF :: F a b -> F c d -> F (a ⊕ c) (b ⊕ d) >+< :: F a b -> F c d -> F (a ⊕ c) (b ⊕ d)
compF fl fr
compF
operate in parallel, indepdenetly of one
another. The high level output streams from the individual
fudgets are tagged and merged into a single stream. The input stream,
which must be tagged, is split up and fed to the appropriate fudget.
>+<
is an infix version of compF
.
Left
and Right
are sent to the left and right
fudgets, respectively.
Left
and Right
, respectively.
fl :: F a b
fr :: F c d