31de773 · rowtype-yoga/purescript-native

79 (>>>) f g = g <<< f

80

81 -- | `Category`s consist of objects and composable morphisms between them, and as such are

82− -- | [`Semigroupoids`](#Semigroupoid), but unlike `semigroupoids` must have an identity element.

82+ -- | [`Semigroupoids`](#semigroupoid), but unlike `semigroupoids` must have an identity element.

83 -- |

84 -- | `Category`s should obey the following rules.

85 -- |

168 infixl 1 <#>

169

170 -- | A `Functor` is intuitively a type which can be mapped over, and more formally a mapping

171− -- | between [`Category`](#Category)s that preserves structure.

171+ -- | between [`Category`](#category)s that preserves structure.

172 -- |

173 -- | `Functor`s should obey the following rules.

174 -- |

189

190 infixl 4 <*>

191

192− -- | `Apply`s are intuitively [`Applicative`](#Applicative)s less `pure`, and more formally a

192+ -- | `Apply`s are intuitively [`Applicative`](#applicative)s less `pure`, and more formally a

193 -- | strong lax semi-monoidal endofunctor.

194 -- |

195 -- | `Apply`s should obey the following rules.

200 class (Functor f) <= Apply f where

201 (<*>) :: forall a b. f (a -> b) -> f a -> f b

202

203− -- | `Applicative`s are [`Functor`](#Functor)s which can be "applied" by sequencing composition

203+ -- | `Applicative`s are [`Functor`](#functor)s which can be "applied" by sequencing composition

204 -- | (`<*>`) or embedding pure expressions (`pure`).

205 -- |

206 -- | `Applicative`s should obey the following rules.

225

226 infixl 1 >>=

227

228− -- | A `Bind` is an [`Apply`](#Apply) with a bind operation which sequentially composes actions.

228+ -- | A `Bind` is an [`Apply`](#apply) with a bind operation which sequentially composes actions.

229 -- |

230 -- | `Bind`s should obey the following rule.

231 -- |