Index: doc/theses/mike_brooks_MMath/intro.tex
===================================================================
--- doc/theses/mike_brooks_MMath/intro.tex	(revision 4205c07430282f54da6322e346312ba528bf99c2)
+++ doc/theses/mike_brooks_MMath/intro.tex	(revision 331f59aea1ab87e4343c4d84c373c60d1732c832)
@@ -5,5 +5,5 @@
 For all three types, languages and/or their libraries supply varying degrees of high-level mechanisms for manipulating these objects at the bulk and component level, such as copying, slicing, extracting, and iterating among elements.
 
-Unfortunately, these three aspects of C cause a significant number of memory errors~\cite{vanOorschot23}.
+Unfortunately, these three aspects of C cause a significant number of memory errors~\cite{Oorschot23}.
 For operating system and browser vendors, who heavily use systems languages, 60\%--70\% of reported software vulnerabilities involved memory errors~\cite{Kehrer23}.
 For Microsoft, 70\% of vulnerabilities addressed via security updates between 2006--2018 are memory safety issues~\cite[slide 10]{Miller19}.
@@ -21,5 +21,4 @@
 
 \section{Array}
-\label{s:ArrayIntro}
 
 An array provides a homogeneous container with $O(1)$ access to elements using subscripting.
@@ -66,4 +65,5 @@
 
 
+\begin{comment}
 \section{Iterator}
 
@@ -72,4 +72,5 @@
 However, the general iteration work is only a sketch for others as future work.
 Nevertheless, sufficed work was done to write out the ideas that developed and how they should apply in the main context of this work. 
+\end{comment}
 
 
@@ -160,4 +161,5 @@
 
 
+\begin{comment}
 \subsection{Iterator}
 
@@ -169,2 +171,3 @@
 This design extends a preexisting proposal to adapt the \CFA (fixed) for-each loop to be more user-pluggable, and builds upon preexisting \CFA coroutines.
 Overall, it simplifies the work a programmer must do to leverage the suspended-state abstraction during iteration.
+\end{comment}