Changeset 8b590a4 for doc/theses/aaron_moss_PhD/phd/frontpgs.tex

Timestamp:

Mar 13, 2019, 11:35:33 AM (7 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, arm-eh, ast-experimental, cleanup-dtors, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum, stuck-waitfor-destruct

Children:

d078afd

Parents:

1c35c78 (diff), 30e32b2 (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/aaron_moss_PhD/phd/frontpgs.tex (modified) (6 diffs)

doc/theses/aaron_moss_PhD/phd/frontpgs.tex

@@ -62 +62 @@
         \bigskip
         
-%       \noindent
-%   \begin{tabbing}
-%   Internal-External Member: \=  \kill % using longest text to define tab length
-%   External Examiner: \>  Bruce Bruce \\ 
-%   \> Professor, Dept. of Philosophy of Zoology, University of Wallamaloo \\
-%   \end{tabbing} 
-%       \bigskip
+        \noindent
+  \begin{tabbing}
+  Internal-External Member: \=  \kill % using longest text to define tab length
+  External Examiner: \>  Doug Lea \\ 
+  \> Professor, Computer Science Department, \\
+  \> State Univesity of New York at Oswego \\
+  \end{tabbing} 
+        \bigskip
         
         \noindent
@@ -74 +75 @@
   Internal-External Member: \=  \kill % using longest text to define tab length
   Supervisor: \> Peter Buhr \\
-  \> Professor, School of Computer Science, University of Waterloo \\
+  \> Associate Professor, School of Computer Science, \\ 
+  \> University of Waterloo \\
   \end{tabbing}
         \bigskip
@@ -81 +83 @@
   \begin{tabbing}
   Internal-External Member: \=  \kill % using longest text to define tab length
-  Internal Members: \> Gregor Richards \\
-  \> Professor, School of Computer Science, University of Waterloo \\
-  \> Ond\v{r}ej Lhot\a'ak \\
-  \> Professor, School of Computer Science, University of Waterloo \\
+  Internal Members: \> Ond\v{r}ej Lhot\a'ak \\
+  \> Associate Professor, School of Computer Science, \\
+  \>University of Waterloo \\
+  \\
+  \> Gregor Richards \\
+  \> Assistant Professor, School of Computer Science, \\
+  \> University of Waterloo \\
   \end{tabbing}
-%       \bigskip
-        
-%       \noindent
-%   \begin{tabbing}
-%   Internal-External Member: \=  \kill % using longest text to define tab length
-%   Internal-External Member: \> Deepa Thotta \\
-%   \> Professor, Dept. of Philosophy, University of Waterloo \\
-%   \end{tabbing}
-%       \bigskip
+        \bigskip
+        
+        \noindent
+  \begin{tabbing}
+  Internal-External Member: \=  \kill % using longest text to define tab length
+  Internal-External Member: \> Werner Dietl \\
+  \> Assistant Professor, Electrical and Computer Engineering, \\
+  \> University of Waterloo \\
+  \end{tabbing}
+%       \bigskip
         
 %       \noindent
@@ -124 +130 @@
 \begin{center}\textbf{Abstract}\end{center}
 
-This is the abstract.
+        The C programming language has been an important software development tool for decades.
+        \CFA{} is a new programming language designed with strong backwards-compatibility to take advantage of widely distributed C programming expertise and the large deployed base of C code, paired with modern language features to improve developer productivity. 
+        
+        This thesis presents a number of improvements to \CFA{}. 
+        The author has developed one major new language feature, generic types, in a way that integrates naturally with both the existing polymorphism features of \CFA{} and the translation-unit-based encapsulation model of C. 
+        This thesis also presents a number of smaller refinements to the \CFA{} overload resolution rules, each of which improves the expressivity or intuitive nature of the language. 
+        
+        This thesis also includes a number of practical improvements to \CFA{} compilation performance, focused on the expression resolution pass, which is the main bottleneck. 
+        These include better algorithms for argument-parameter matching and type assertion satisfaction, as well as a new type-environment data-structure based on a novel variant of union-find. 
+        The compilation performance improvements have all been experimentally validated with a new prototype system that encapsulates the key aspects of the \CFA{} language; this prototype is a promising basis for future research and a technical contribution of this work.
 
 \cleardoublepage
@@ -131 +146 @@
 % -------------------------------
 
-% \begin{center}\textbf{Acknowledgements}\end{center}
-
-% I would like to thank all the little people who made this thesis possible.
-% \cleardoublepage
+\begin{center}\textbf{Acknowledgements}\end{center}
+
+Though a doctoral thesis is an individual project, I could not have completed it without the help and support of many members of my community. 
+This thesis would not exist in the form it does without the mentorship of my advisor, Peter Buhr, who has ably led the \CFA{} team while giving me both the advantage of his decades of experience and the freedom to follow my own interests. 
+
+My work on \CFA{} does not exist in a vaccuum, and it has been a pleasure and a privilege to collaborate with the members of the \CFA{} team: Andrew Beach, Richard Bilson, Michael Brooks, Bryan Chan, Thierry Delisle, Glen Ditchfield, Brice Dobry, Rob Schluntz, and others.
+I gratefully acknowledge the financial support of the National Science and Engineering Council of Canada and Huawei Ltd.\ for this project.
+I would also like to thank of my thesis committee, Werner Dietl, Doug Lea, Ond\v{r}ej Lhot\a'ak, and Gregor Richards, for the time and effort they have invested in providing constructive feedback to refine this work.
+I am indebted to Peter van Beek and Ian Munro for their algorithmic expertise and willingness to share their time with me. 
+I have far too many colleagues in the Programming Languages Group and School of Computer Science to name, but I deeply appreciate their camaradarie; specifically with regard to the production of this thesis, I would like to thank Nathan Fish for recommending my writing soundtrack, and Sharon Choy for her unfailing supply of encouraging rabbit animations.
+
+Finally, to all my friends and family who have supported me and made Kitchener-Waterloo home these past seven years, thank you, I could not have done it without you; most especially, Christina Moss, you are the best of wives and best of women, your support has kept me going through the ups and downs of research, and your partnership is key to all my successes.
+
+\cleardoublepage
 
 % D E D I C A T I O N
@@ -141 +166 @@
 % \begin{center}\textbf{Dedication}\end{center}
 
-% This is dedicated to the one I love.
+% To Christina, who has spent too many hours politely listening to me work out the technical minutiae of this thesis, I love you, and I won't make you read it.
+
 % \cleardoublepage