ADTaaron-thesisarm-ehast-experimentalcleanup-dtorsenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprpthread-emulationqualifiedEnum
Last change
on this file since 4ba22b8 was
8adcfee,
checked in by Aaron Moss <a3moss@…>, 5 years ago
|
thesis: first draft of conclusion
|
-
Property mode set to
100644
|
File size:
2.3 KB
|
Rev | Line | |
---|
[2a9d12d] | 1 | \chapter{Conclusion} |
---|
| 2 | |
---|
[8adcfee] | 3 | Decades after its first standardization, the C language remains a widely-used tool and a vital part of the software development landscape. |
---|
| 4 | The \CFA{} language under development at the University of Waterloo represents an evolutionary modernization of C with expressive modern language features paired with strong C backwards-compatibility. |
---|
| 5 | This thesis has contributed to those project goals in a variety of ways, including the addition of a generic types language feature (Chapter~\ref{generic-chap}) and refinement of the \CFA{} overload selection rules to produce a more expressive and intuitive model (Section~\ref{conv-cost-sec}). |
---|
| 6 | Based on the technical contribution of the resolver prototype system (Section~\ref{rp-features-sec}), I have also made significant improvements to \CFA{} compilation performance, including un-combined bottom-up expression traversal (Section~\ref{arg-parm-matching-sec}), deferred-cached assertion satisfaction (Section~\ref{assn-sat-sec}), and a novel persistent union-find type environment data structure (Section~\ref{env-persistent-union-find}). |
---|
| 7 | The combination of these practical improvements and added features significantly improve the viability of \CFA{} as a practical programming language. |
---|
| 8 | |
---|
| 9 | Further improvements to \CFA{} are still possible, however. |
---|
| 10 | One area suggested by this work is development of a scheme for user-defined conversions; to integrate properly with the \CFA{} conversion model, there would need to be a distinction between safe and unsafe conversions, and possibly a way to denote conversions as explicit-only or non-chainable. |
---|
| 11 | Another place for ongoing effort is improvement of compilation performance; I believe the most promising direction for that is rebuilding the \CFA{} compiler on a different framework than Bilson's \CFACC{}. |
---|
| 12 | The resolver prototype presented in this work has good performance and already has the basics of \CFA{} semantics implemented, as well as many of the necessary core data structures, and would be a viable candidate for a new compiler architecture. |
---|
| 13 | An alternate approach would be to fork an existing C compiler such as Clang~\cite{Clang}, which would need to be modified to use one of the resolution algorithms discussed here, as well as various other features introduced by Bilson~\cite{Bilson03}. |
---|
Note: See
TracBrowser
for help on using the repository browser.