Index: doc/theses/jiada_liang_MMath/CFAenum.tex
===================================================================
--- doc/theses/jiada_liang_MMath/CFAenum.tex	(revision 38f49535be35ae1d2639d4c8998a06eaf41e74a2)
+++ doc/theses/jiada_liang_MMath/CFAenum.tex	(revision f9da7618922cfffae1c2df08c6aebb72d2ded799)
@@ -201,5 +201,5 @@
 \section{Enumeration Pseudo-functions}
 
-Pseudo-functions are function-like operators that do not result in any run-time computations, i.e., like @sizeof@, @offsetof@, @typeof@.
+Pseudo-functions are function-like operators that do not result in any run-time computations, \ie like @sizeof@, @offsetof@, @typeof@.
 Often a call to a pseudo-function is substituted with information extracted from the symbol table at compilation time, like storage size or alignment associated with the underlying architecture..
 
@@ -250,5 +250,5 @@
 \end{cquote}
 Here, the intuitive code on the left is implicitly transformed into the statndard implementation on the right, using the value of the enumeration variable and enumerators.
-However, this implementation is fragile, e.g., if the enumeration is changed to:
+However, this implementation is fragile, \eg if the enumeration is changed to:
 \begin{cfa}
 enum Count { First, Second, Third @= First@, Fourth };
Index: doc/theses/jiada_liang_MMath/background.tex
===================================================================
--- doc/theses/jiada_liang_MMath/background.tex	(revision 38f49535be35ae1d2639d4c8998a06eaf41e74a2)
+++ doc/theses/jiada_liang_MMath/background.tex	(revision f9da7618922cfffae1c2df08c6aebb72d2ded799)
@@ -22,6 +22,6 @@
 \end{cfa}
 This feature allow enumerator lines to be interchanged without moving a comma.\footnote{
-A terminating comma appears in other C syntax, e.g., the initializer list.}
-Finally, C enumerators are \Newterm{unscoped}, i.e., enumerators declared inside of an @enum@ are visible (projected) into the enclosing scope of the @enum@ type.
+A terminating comma appears in other C syntax, \eg the initializer list.}
+Finally, C enumerators are \Newterm{unscoped}, \ie enumerators declared inside of an @enum@ are visible (projected) into the enclosing scope of the @enum@ type.
 
 In theory, a C enumeration \emph{variable} is an implementation-defined integral type large enough to hold all enumerated values.
Index: doc/theses/jiada_liang_MMath/implementation.tex
===================================================================
--- doc/theses/jiada_liang_MMath/implementation.tex	(revision 38f49535be35ae1d2639d4c8998a06eaf41e74a2)
+++ doc/theses/jiada_liang_MMath/implementation.tex	(revision f9da7618922cfffae1c2df08c6aebb72d2ded799)
@@ -307,5 +307,5 @@
 \section{Iteration and Range}
 
-It is convenient to iterate over a \CFA enumeration value, e.g.:
+It is convenient to iterate over a \CFA enumeration value, \eg:
 \begin{cfa}[label=lst:range_functions]
 for ( Alphabet alph; Alphabet ) { sout | alph; }
Index: doc/theses/jiada_liang_MMath/intro.tex
===================================================================
--- doc/theses/jiada_liang_MMath/intro.tex	(revision 38f49535be35ae1d2639d4c8998a06eaf41e74a2)
+++ doc/theses/jiada_liang_MMath/intro.tex	(revision f9da7618922cfffae1c2df08c6aebb72d2ded799)
@@ -1,5 +1,5 @@
 \chapter{Introduction}
 
-Naming values is a common practice in mathematics and engineering, e.g., $\pi$, $\tau$ (2$\pi$), $\phi$ (golden ratio), MHz (1E6), etc.
+Naming values is a common practice in mathematics and engineering, \eg $\pi$, $\tau$ (2$\pi$), $\phi$ (golden ratio), MHz (1E6), etc.
 Naming is also commonly used to represent many other numerical phenomenon, such as days of the week, months of a year, floors of a building (basement), specific times (noon, New Years).
 Many programming languages capture this important software-engineering capability through a mechanism called an \Newterm{enumeration}.
@@ -8,5 +8,5 @@
 
 Specifically, an enumerated type restricts its values to a fixed set of named constants.
-While all types are restricted to a fixed set of values because of the underlying von Neumann architecture, and hence, to a corresponding set of constants, e.g., @3@, @3.5@, @3.5+2.1i@, @'c'@, @"abc"@, etc., these values are not named, other than the programming-language supplied constant names.
+While all types are restricted to a fixed set of values because of the underlying von Neumann architecture, and hence, to a corresponding set of constants, \eg @3@, @3.5@, @3.5+2.1i@, @'c'@, @"abc"@, etc., these values are not named, other than the programming-language supplied constant names.
 
 Fundamentally, all enumeration systems have an \Newterm{enumeration} type with an associated set of \Newterm{enumerator} names.
@@ -25,4 +25,6 @@
 Here, the \Newterm{enumeration} @Weekday@ defines the ordered \Newterm{enumerator}s @Monday@, @Tuesday@, @Wednesday@, @Thursday@, @Friday@, @Saturday@ and @Sunday@.
 By convention, the successor of @Tuesday@ is @Monday@ and the predecessor of @Tuesday@ is @Wednesday@, independent of the associated enumerator constant values.
-Because an enumerator is a constant, it cannot appear in a mutable context, e.g. @Mon = Sun@ is meaningless, and an enumerator has no address, it is an \Newterm{rvalue}\footnote{
+Because an enumerator is a constant, it cannot appear in a mutable context, \eg @Mon = Sun@ is meaningless, and an enumerator has no address, it is an \Newterm{rvalue}\footnote{
 The term rvalue defines an expression that can only appear on the right-hand side of an assignment.}.
+
+\section{Contributions}
Index: doc/theses/jiada_liang_MMath/uw-ethesis-frontpgs.tex
===================================================================
--- doc/theses/jiada_liang_MMath/uw-ethesis-frontpgs.tex	(revision 38f49535be35ae1d2639d4c8998a06eaf41e74a2)
+++ doc/theses/jiada_liang_MMath/uw-ethesis-frontpgs.tex	(revision f9da7618922cfffae1c2df08c6aebb72d2ded799)
@@ -131,5 +131,5 @@
 \begin{center}\textbf{Abstract}\end{center}
 
-An enumeration is a type defining an ordered set of named constant values, where a name abstracts a value, e.g., @PI@ versus @3.145159@.
+An enumeration is a type defining an ordered set of named constant values, where a name abstracts a value, \eg @PI@ versus @3.145159@.
 C restrict an enumeration type to the integral type @signed int@, which \CC support , meaning enumeration names bind to integer constants.
 \CFA extends C enumerations to allow all basic and custom types for the enumeration type, like other modern programming languages.