Changeset 930a800 for doc/theses/colby_parsons_MMAth/text/conclusion.tex

Timestamp:

Jul 4, 2023, 12:42:47 PM (16 months ago)

Author:

caparsons <caparson@…>

Branches:

master

Children:

0ec4eb0

Parents:

5e81a9c

Message:

added conclusion to makefile, removed duplicate bib entry and added conclusion to thesis.tex

File:

• doc/theses/colby_parsons_MMAth/text/conclusion.tex (modified) (2 diffs)

doc/theses/colby_parsons_MMAth/text/conclusion.tex

@@ -15 +15 @@
 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 +35 @@
 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.
+