Index: doc/theses/aaron_moss_PhD/phd/experiments.tex
===================================================================
--- doc/theses/aaron_moss_PhD/phd/experiments.tex	(revision 83a096484bb3bcfd9b798e95f52117de529f5f42)
+++ doc/theses/aaron_moss_PhD/phd/experiments.tex	(revision 7e9fa47abe93da3b9a125cb18495a2ea3da0d736)
@@ -200,5 +200,5 @@
 	
 
-\section{\CFA{} Results}
+\section{\CFA{} Results} \label{cfa-results-sec}
 
 I have integrated most of the algorithmic techniques discussed in this chapter into \CFACC{}. 
@@ -233,2 +233,13 @@
 
 % look back at Resolution Algorithms section for threads to tie up "does the algorithm look like this?"
+
+\section{Conclusion}
+
+As can be seen from the prototype results, per-expression benchmarks, and \CFACC{}, the dominant factor in the cost of \CFA{} expression resolution is assertion satisfaction. 
+Reducing the number of total number of assertion satisfaction problems solved, as in the deferred satisfaction algorithm, is consistently effective at reducing runtime, and caching results of these satisfaction problems has shown promise in the prototype system. 
+The results presented here also demonstrate that a bottom-up approach to expression resolution is superior to top-down, settling an open question from Baker~\cite{Baker82}.
+The persistent union-find type environment introduced in Chapter~\ref{env-chap} has also been demonstrated to be a modest performance improvement on the na\"{\i}ve approach.
+
+Given the consistently strong performance of the \textsc{bu-dca-imm} and \textsc{bu-dca-per} variants of the resolver prototype, the results in this chapter demonstrate that it is possible to develop a \CFA{} compiler with acceptable runtime performance for widespread use, an important and previously unaddressed consideration for the practical viability of the language. 
+However, the less-marked improvement in Section~\ref{cfa-results-sec} from retrofitting these algorithmic changes onto the existing compiler leave the actual development of a performant \CFA{} compiler to future work. 
+Characterization and elimination of the performance deficits in the existing \CFACC{} has proven difficult, though runtime is generally dominated by the expression resolution phase; as such, building a new \CFA{} compiler based on the resolver prototype contributed by this work may prove to be an effective strategy.