Revise everything (3)

cain.bib

@@ -18,7 +18,8 @@ @book{adamek-et-al-2006
 }
 
 @online{agda,
-  author       = {Agda Team, The},
+  author       = {{The Agda Team}},
+  sortname     = {Agda Team, The},
   title        = {The Agda Wiki},
   date         = {2014},
   url          = {http://wiki.portal.chalmers.se/agda/},

introduction.tex

@@ -274,8 +274,10 @@ \section{Notes}
 \item
   The Agda code was tested with Agda 2.3.2.2 and the Agda standard
   library 0.7 \parencite{danielsson-2013}. We omit a lot of details
-  such as import declarations, but all the code can be found in a Git
-  repository which is available at
+  such as import declarations.
+
+\item
+  All the code can be found in a Git repository which is available at
   \url{https://github.com/jpvillaisaza/abel}.
 
 \end{itemize}

monads.tex

@@ -19,7 +19,7 @@ \chapter{Monads and Kleisli Triples}
 \end{codehaskell}
 Or, equivalently, desugaring the list comprehension:
 \begin{codehaskell}
-cartesian xs ys = xs >>= \ x -> ys >>= \ y -> return (x,y)
+cartesian xs ys = xs >>= \x -> ys >>= \y -> return (x,y)
 \end{codehaskell}
 This is but one simple example to show that ``a monad is often an
 obvious and useful tool to help solve a problem''
@@ -1298,7 +1298,7 @@ \subsection{Equivalence of Monads and Kleisli Triples in Haskell}
 fmap f mx = bind (return . f) mx
 
 liftM :: Monad m => (a -> b) -> m a -> m b
-liftM f m x = mx >>= (return . f)
+liftM f mx = mx >>= (return . f)
 \end{codehaskell}
 This definition of \texthaskell{fmap} is just
 \eqref{eq:triple-to-endofunctor-morphism-function}. Finally, the