@@ -79,7 +79,7 @@ module Prelude
7979 (>>>) f g = g <<< f
8080
8181 -- | `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.
8383 -- |
8484 -- | `Category`s should obey the following rules.
8585 -- |
@@ -168,7 +168,7 @@ module Prelude
168168 infixl 1 <#>
169169
170170 -- | 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.
172172 -- |
173173 -- | `Functor`s should obey the following rules.
174174 -- |
@@ -189,7 +189,7 @@ module Prelude
189189
190190 infixl 4 <*>
191191
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
193193 -- | strong lax semi-monoidal endofunctor.
194194 -- |
195195 -- | `Apply`s should obey the following rules.
@@ -200,7 +200,7 @@ module Prelude
200200 class (Functor f) <= Apply f where
201201 (<*>) :: forall a b. f (a -> b) -> f a -> f b
202202
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
204204 -- | (`<*>`) or embedding pure expressions (`pure`).
205205 -- |
206206 -- | `Applicative`s should obey the following rules.
@@ -225,7 +225,7 @@ module Prelude
225225
226226 infixl 1 >>=
227227
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.
229229 -- |
230230 -- | `Bind`s should obey the following rule.
231231 -- |