Index: doc/theses/colby_parsons_MMAth/text/frontpgs.tex
===================================================================
--- doc/theses/colby_parsons_MMAth/text/frontpgs.tex	(revision 56eb7f84a54eeb26644012f9753813b664ea85f2)
+++ doc/theses/colby_parsons_MMAth/text/frontpgs.tex	(revision 9171456b2a1bc5b89549d97ced24a2388e00a1b0)
@@ -80,5 +80,5 @@
 Concurrent programs are notoriously hard to program and even harder to debug. Furthermore concurrent programs must be performant, as the introduction of concurrency into a program is often done to achieve some form of speedup.
 
-This thesis presents a suite of high-level concurrent-language features in the new programming-language \CFA, all of which are implemented with the aim of improving the performance, productivity, and safety of concurrent programs.
+This thesis presents a suite of high-level concurrent-language features in the new programming language \CFA, all of which are implemented with the aim of improving the performance, productivity, and safety of concurrent programs.
 \CFA is a non-object-oriented programming language that extends C.
 The foundation for concurrency in \CFA was laid by Thierry Delisle~\cite{Delisle18}, who implemented coroutines, user-level threads, and monitors.