diff --git a/src/Control/Arrow/Free.hs b/src/Control/Arrow/Free.hs
index a7e3ad1..3f5fa44 100644
--- a/src/Control/Arrow/Free.hs
+++ b/src/Control/Arrow/Free.hs
@@ -126,15 +126,15 @@ newtype A f a b
              -> r a b
       }
 
--- |
--- Isomorphism from @'Arr'@ to @'A'@, which is a specialisation of
+-- | Isomorphism from @'Arr'@ to @'A'@, which is a specialisation of
 -- @'hoistFreeH2'@.
+--
 toA :: Arr f a b -> A f a b
 toA = hoistFreeH2
 {-# INLINE toA #-}
 
--- |
--- Inverse of @'fromA'@, which also is a specialisatin of @'hoistFreeH2'@.
+-- | Inverse of @'fromA'@, which also is a specialisation of @'hoistFreeH2'@.
+--
 fromA :: A f a b -> Arr f a b
 fromA = hoistFreeH2
 {-# INLINE fromA #-}
diff --git a/src/Control/Category/Free.hs b/src/Control/Category/Free.hs
index 00c3bd8..163eb31 100644
--- a/src/Control/Category/Free.hs
+++ b/src/Control/Category/Free.hs
@@ -82,8 +82,7 @@ import           Control.Category.Free.Internal
 -- CPS style free categories
 --
 
--- |
--- CPS style encoded free category; one can use @'FreeAlgebra2'@ class
+-- | CPS style encoded free category; one can use @'FreeAlgebra2'@ class
 -- instance:
 --
 -- > liftFree2    @C :: f a b -> C f a b
@@ -101,15 +100,15 @@ composeC :: C f y z -> C f x y -> C f x z
 composeC (C g) (C f) = C $ \k -> g k . f k
 {-# INLINE [1] composeC #-}
 
--- |
--- Isomorphism from @'ListTr'@ to @'C'@, which is a specialisation of
+-- | Isomorphism from @'ListTr'@ to @'C'@, which is a specialisation of
 -- @'hoistFreeH2'@.
+--
 toC :: ListTr f a b -> C f a b
 toC = hoistFreeH2
 {-# INLINE toC #-}
 
--- |
--- Inverse of @'fromC'@, which also is a specialisation of @'hoistFreeH2'@.
+-- | Inverse of @'fromC'@, which also is a specialisation of @'hoistFreeH2'@.
+--
 fromC :: C f a b -> ListTr f a b
 fromC = hoistFreeH2
 {-# INLINE fromC #-}
diff --git a/src/Control/Category/Free/Internal.hs b/src/Control/Category/Free/Internal.hs
index 22d4372..3c19850 100644
--- a/src/Control/Category/Free/Internal.hs
+++ b/src/Control/Category/Free/Internal.hs
@@ -53,7 +53,7 @@ import           Control.Algebra.Free2 ( AlgebraType0
                                        , Proof (..)
                                        )
 
--- | Oposite categoy in which arrows from @a@ to @b@ are represented by arrows
+-- | Opposite category in which arrows from @a@ to @b@ are represented by arrows
 -- from @b@ to @a@ in the original category.
 --
 newtype Op (f :: k -> k -> Type) (a :: k) (b :: k) = Op { runOp :: f b a }
@@ -241,7 +241,7 @@ instance ArrowChoice f => ArrowChoice (ListTr f) where
 --
 
 
--- | Type aligned real time queues; Based on `Purely Functinal Data Structures`
+-- | Type aligned real time queues; Based on `Purely Functional Data Structures`
 -- C.Okasaki.  This the most reliably behaved implementation of free categories
 -- in this package.
 --
diff --git a/src/Control/Category/FreeEffect.hs b/src/Control/Category/FreeEffect.hs
index 5c2ec5c..de06724 100644
--- a/src/Control/Category/FreeEffect.hs
+++ b/src/Control/Category/FreeEffect.hs
@@ -27,7 +27,7 @@ import Control.Algebra.Free2 (FreeAlgebra2 (..))
 import Data.Algebra.Free (AlgebraType, AlgebraType0, Proof (..))
 
 
--- | Categories which can lift monadic actions, i.e. effectful categories.
+-- | Categories which can lift monadic actions, i.e effectful categories.
 --
 class Category c => EffectCategory c m | c -> m where
   effect :: m (c a b) -> c a b