Index: doc/theses/mike_brooks_MMath/background.tex
===================================================================
--- doc/theses/mike_brooks_MMath/background.tex	(revision f1ffc4761c9763c05ecba2d6553260871f14e11c)
+++ doc/theses/mike_brooks_MMath/background.tex	(revision b3e77ccdb5d96904f3321754a393797b0a9902cd)
@@ -224,6 +224,6 @@
 \end{tabular}
 \end{cquote}
-I believe it is possible to refute any code examples purporting to show pointer arithmetic is faster than subscripting.
-This believe stems from the performance work I did on \CFA arrays, where it is possible to generate equivalent \CFA subscripting and performance to C subscripting.
+% I believe it is possible to refute any code examples purporting to show pointer arithmetic is faster than subscripting.
+% This believe stems from the performance work I did on \CFA arrays, where it is possible to generate equivalent \CFA subscripting and performance to C subscripting.
 
 Unfortunately, C semantics want a programmer to \emph{believe} an array variable is a \emph{pointer to its first element}.
Index: doc/theses/mike_brooks_MMath/intro.tex
===================================================================
--- doc/theses/mike_brooks_MMath/intro.tex	(revision f1ffc4761c9763c05ecba2d6553260871f14e11c)
+++ doc/theses/mike_brooks_MMath/intro.tex	(revision b3e77ccdb5d96904f3321754a393797b0a9902cd)
@@ -39,10 +39,10 @@
 Therefore, hardening the three primary collections goes a long way to making the majority of C programs safer, eliminating major hacker attack vectors.
 
-This work looks at extending these foundational container types in the programming language \CFA, which is a new dialect of the C programming language.
+My work looks at extending these foundational container types in the programming language \CFA, which is a new dialect of the C programming language.
 A primary goal of \CFA~\cite{Cforall} is 99\% backward compatibility with C, while maintaining a look and feel that matches with C programmer experience and intuition.
 This goal requires ``thinking inside the box'' to engineer new features that ``work and play'' with C and its massive legacy code-base.
 An equally important goal is balancing good performance with safety.
 
-The thesis describes improvements made to the \CFA language design, both syntax and semantics, to support the container features, and the source code created within the \CFA compiler, libraries, and runtime system to implement these features.
+The thesis describes improvements I made to the \CFA language design, both syntax and semantics, to support the container features, and the source code created within the \CFA compiler, libraries, and runtime system to implement these features.
 This work leverages preexisting work within the compiler's type and runtime systems generated by prior graduate students working on the \CFA project.
 
@@ -158,5 +158,5 @@
 Overall, this work has produced significant syntactic and semantic improvements to C's arrays, linked-lists and string types.
 % As well, a strong plan for general iteration has been sketched out.
-The following are the detailed contributions, where performance and safety are always the motivating factors.
+The following are my detailed contributions, where performance and safety are always the motivating factors.
 
 \subsection{Array}