19264f8 · rowtype-yoga/purescript-native

87```

88

89`Category`s consist of objects and composable morphisms between them, and as such are

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

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

91

92`Category`s should obey the following rules.

93

184```

185

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

187−between [`Category`](#Category)s that preserves structure.

187+between [`Category`](#category)s that preserves structure.

188

189`Functor`s should obey the following rules.

190

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

217```

218

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

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

220strong lax semi-monoidal endofunctor.

221

222`Apply`s should obey the following rules.

232 pure :: forall a. a -> f a

233```

234

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

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

236(`<*>`) or embedding pure expressions (`pure`).

237

238`Applicative`s should obey the following rules.

264 (>>=) :: forall a b. m a -> (a -> m b) -> m b

265```

266

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

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

268

269`Bind`s should obey the following rule.

270