Index: doc/aaron_comp_II/comp_II.tex
===================================================================
--- doc/aaron_comp_II/comp_II.tex	(revision 95330f505d3db6bf870b87bec32777dd8e69faf9)
+++ doc/aaron_comp_II/comp_II.tex	(revision 6162e0e14e9c8548f662f4fb925c7d06b804fa8e)
@@ -363,13 +363,21 @@
 
 \section{Proposal}
-
+Baker\cite{Baker82} discussed various expression resolution algorithms that could handle name overloading, but left experimental comparison of those algorithms to future work; Bilson\cite{Bilson03} described one extension of Baker's algorithm to handle implicit conversions, but did not fully explore the space of algorithmic approaches to handle both overloaded names and implicit conversions. 
+This project is intended to experimentally test a number of expression resolution algorithms which are powerful enough to handle the \CFA type system, including both name overloading and implicit conversions. 
+This comparison will close Baker's open research question, as well as potentially improving on Bilson's \CFA compiler.
+
+Rather than testing all of these algorithms in-place in the \CFA compiler, a resolver prototype will be developed which acts on a simplified input language encapsulating the essential details of the \CFA type system\footnote{Note that this simplified input language is not required to be a usable programming language.}. 
+Multiple variants of this resolver prototype will be implemented, each encapsulating a different expression resolution variant, sharing as much code as feasible. 
+These variants will be instrumented to test runtime performance, and run on a variety of input files; the input files may be generated programmatically or from exisiting code in \CFA or similar languages.
+These experimental results will allow the research team to determine the algorithm likely to be most performant in practical use, and replace {CFA-CC}'s existing expression resolver with that code. 
+The experimental results will also provide some empirical sense of the compile-time cost of various language features by comparing the results of the most performant resolver variant that supports the feature with the most performant resolver variant that doesn't, a useful capability to guide language design.
 
 \appendix
-\section{Completion Timeline}\label{app:completion}
+\section{Completion Timeline}
 The following is a preliminary estimate of the time necessary to complete the major components of this research project:
 \begin{center}
 \begin{tabular}{ | r @{--} l | p{4in} | }
 \hline       May 2015 & April 2016   & Project familiarization and generic types design \& implementation. \\
-\hline       May 2016 & April 2017   & Design \& implement prototype resolver and run performance experiments. \\
+\hline       May 2016 & April 2017   & Design \& implement resolver prototype and run performance experiments. \\
 \hline       May 2017 & August 2017  & Integrate new language features and best-performing resolver prototype into {CFA-CC}. \\
 \hline September 2017 & January 2018 & Thesis writing \& defense. \\