Index: doc/theses/colby_parsons_MMAth/Makefile
===================================================================
--- doc/theses/colby_parsons_MMAth/Makefile	(revision 5e81a9cc9dbc35b46a393e89b9264dd8632ba1c3)
+++ doc/theses/colby_parsons_MMAth/Makefile	(revision 930a800d95c4ebe80fc011c1c98e9618616daee6)
@@ -23,4 +23,5 @@
 	text/channels \
 	text/waituntil \
+	text/conclusion \
 }
 
Index: doc/theses/colby_parsons_MMAth/local.bib
===================================================================
--- doc/theses/colby_parsons_MMAth/local.bib	(revision 5e81a9cc9dbc35b46a393e89b9264dd8632ba1c3)
+++ doc/theses/colby_parsons_MMAth/local.bib	(revision 930a800d95c4ebe80fc011c1c98e9618616daee6)
@@ -168,11 +168,4 @@
 }
 
-@misc{openmp,
-  author = "OpenMP",
-  title = "OPENMP API Specification",
-  howpublished = {\href{https://www.openmp.org/spec-html/5.0/openmpch1.html}},
-  note = "[Online; accessed 23-May-2023]"
-}
-
 @techreport{wilson94,
   title={The suif compiler system: a parallelizing and optimizing research compiler},
Index: doc/theses/colby_parsons_MMAth/text/conclusion.tex
===================================================================
--- doc/theses/colby_parsons_MMAth/text/conclusion.tex	(revision 5e81a9cc9dbc35b46a393e89b9264dd8632ba1c3)
+++ doc/theses/colby_parsons_MMAth/text/conclusion.tex	(revision 930a800d95c4ebe80fc011c1c98e9618616daee6)
@@ -15,5 +15,5 @@
 This thesis scratches the surface of implicit concurrency by providing an actor system.
 There is room for more implicit concurrency tools in \CFA.
-User-defined implicit concurrency in the form of annotated loops or recursive functions exists in many other languages and libraries~\cite{uC++,openmp}. Similar implicit concurrency mechanisms could be implemented and expanded on in \CFA.
+User-defined implicit concurrency in the form of annotated loops or recursive functions exists in many other languages and libraries~\cite{uC++,OpenMP}. Similar implicit concurrency mechanisms could be implemented and expanded on in \CFA.
 Additionally, the problem of automatic parallelism of sequential programs via the compiler is an interesting research space that other languages have approached~\cite{wilson94,haskell:parallel} that could also be explored in \CFA.
 
@@ -35,2 +35,3 @@
 All these problems and more could benefit from language support in \CFA.
 Adding good language support for atomics is a difficult and nuanced problem, which if solved well would allow for easier and safer writing of low-level concurrent code.
+
Index: doc/theses/colby_parsons_MMAth/thesis.tex
===================================================================
--- doc/theses/colby_parsons_MMAth/thesis.tex	(revision 5e81a9cc9dbc35b46a393e89b9264dd8632ba1c3)
+++ doc/theses/colby_parsons_MMAth/thesis.tex	(revision 930a800d95c4ebe80fc011c1c98e9618616daee6)
@@ -206,4 +206,6 @@
 \input{waituntil}
 
+\input{conclusion}
+
 %----------------------------------------------------------------------
 % END MATERIAL