Adding ‘Acknowledgments’ section

src/content/1.3/Categories Great and Small.tex

@@ -322,11 +322,6 @@ follow the rules of composition, and as points in a set. Here,
 composition of morphisms in M translates into monoidal product in the
 set \code{M(m, m)}.
 
-\section{Acknowledgments}\label{acknowledgments}
-
-I'd like to thank Andrew Sutton for rewriting my C++ monoid concept code
-according to his and Bjarne Stroustrup's latest proposal.
-
 \section{Challenges}\label{challenges}
 
 \begin{enumerate}

src/content/1.4/Kleisli Categories.tex

@@ -467,13 +467,4 @@ Here's the challenge:
   Compose \code{safe\_root} and \code{safe\_reciprocal} to implement\\
   \code{safe\_root\_reciprocal} that calculates \code{sqrt(1/x)}
   whenever possible.
-\end{enumerate}
+\end{enumerate}
-
-\section{Acknowledgments}\label{acknowledgments}
-
-I'm grateful to Eric Niebler for reading the draft and providing the
-clever implementation of \code{compose} that uses advanced features of
-C++14 to drive type inference. I was able to cut the whole section of
-old fashioned template magic that did the same thing using type traits.
-Good riddance! I'm also grateful to Gershom Bazerman for useful comments
-that helped me clarify some important points.

src/content/1.5/Products and Coproducts.tex

@@ -730,9 +730,4 @@ int j(bool b) { return b? 0: 1; }
   The Catsters,
   \href{https://www.youtube.com/watch?v=upCSDIO9pjc}{Products and
   Coproducts} video.
-\end{enumerate}
+\end{enumerate}
-
-\section{Acknowledments}\label{acknowledments}
-
-I'm grateful to Gershom Bazerman for reviewing this post before
-publication and for stimulating discussions.

src/content/1.6/Simple Algebraic Data Types.tex

@@ -616,9 +616,4 @@ circ (Rect d h) = 2.0 * (d + h)
   Show that \code{a\ +\ a\ =\ 2\ *\ a} holds for types (up to
   isomorphism). Remember that \code{2} corresponds to \code{Bool},
   according to our translation table.
-\end{enumerate}
+\end{enumerate}
-
-\section{Acknowledments}\label{acknowledments}
-
-Thanks go to Gershom Bazerman for reviewing this post and helpful
-comments.

src/sicp.texi

@@ -112,9 +112,24 @@ PDF compiled by @url{https://github.com/hmemcpy/milewski-ctfp-pdf, Igal Tabachni
 
 @unnumbered Acknowledgments
 
+@noindent
+I’d like to thank Andrew Su on for rewriting my C++ monoid concept
+code according to his and Bjarne Stroustrup’s latest proposal.
+
+@sp 1.0
+@noindent
 Gershom Bazerman is kind enough to keep reviewing these posts. I'm
 grateful for his patience and insight.
 
+@sp 1.0
+@noindent
+I'm grateful to Eric Niebler for reading the draft and providing the
+clever implementation of \code{compose} that uses advanced features of
+C++14 to drive type inference. I was able to cut the whole section of
+old fashioned template magic that did the same thing using type traits.
+Good riddance! I'm also grateful to Gershom Bazerman for useful comments
+that helped me clarify some important points.
+
 \setindexprenote{\normalsize \begin{quote} Any inaccuracies in this index may be explained by the fact
 that it has been prepared with the help of a computer.