Context Navigation

-              r28182444
+              rbb506e0
 Specifically, the resolution algorithms used in \CC and Java are greedy, selecting the best match for each subexpression without considering the higher-level ones (bottom-up).
 Therefore, at each resolution step, the arguments are already given unique interpretations, so the ordering only needs to compare different sets of conversion targets (function parameter types) on the same set of input.
-\begin{cfa}
-@generate a C++ example here@
-read more
-\end{cfa}
 In \CFA, trying to use such a system is problematic because of the presence of return-type overloading of functions and variable.

doc/theses/fangren_yu_MMath/uw-ethesis-frontpgs.tex

-              r28182444
+              rbb506e0
 \begin{center}\textbf{Abstract}\end{center}
+Type resolution ...
+\CFA (C-for-all) is an evolutionary extension of C programming language, which introduces many modern programming language features to C.
+\CFA has a type system built around parametric polymorphism, and the polymorphic functions are prefixed by a @forall@ declaration of type parameters, giving the language its name.
+This thesis presents a series of work on type resolution in \CFA. Every function, including the built-in C operators, can be overloaded in \CFA, therefore resolving function overloads and generic type parameters is at the heart of \CFA expression analysis. This thesis focuses on the interactions of various \CFA language features such as reference and generic types in type resolution, analyzes the known issues and presents improvements to the type system that fix those problems. Ideas for future work are also given for further improving the consistency of \CFA type system at a language design level.
 \cleardoublepage

Note: See TracChangeset for help on using the changeset viewer.