Changeset 831b2ec

Timestamp:

Apr 10, 2025, 6:07:28 PM (7 months ago)

Author:

Michael Brooks <mlbrooks@…>

Branches:

master

Children:

d175767

Parents:

234c432 (diff), aacd1e1 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

File:

• doc/theses/fangren_yu_MMath/uw-ethesis-frontpgs.tex (modified) (1 diff)

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

@@ -131 +131 @@
 \begin{center}\textbf{Abstract}\end{center}
 
-\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.
+\CFA (C-for-all) is an evolutionary extension of the 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 I did 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 several of the problems.
+Ideas for future work are also given for further improving the consistency of the \CFA type-system at a language design level.
 
 \cleardoublepage