source: doc/theses/jiada_liang_MMath/conclusion.tex @ d3b33d5

\chapter{Conclusion}
\label{c:conclusion}

This work aims to extend the simple and unsafe enumeration type in the C programming language into a complex and safe enumeration type in the \CFA programming language while maintaining backward compatibility with C.
Within this goal, the new \CFA enumeration should align with the analogous enumeration features in other languages to match modern programming expectations.
Hence, the \CFA enumeration features are borrowed from a number of programming languages, but engineered to work and play with \CFA's type system and feature set.

Strong type-checking of enumeration initialization and assignment provides additional safety, ensuring an enumeration only contains its enumerators.
Overloading and scoping of enumerators significantly reduces the naming problem, providing a better software-engineering environment, with fewer name clashes and the ability to disambiguate those that cannot be implicitly resolved.
Typed enumerations solve the data-harmonization problem, increasing safety through better software engineering.
Moreover, integrating enumerations with existing control structures provides a consistent upgrade for programmers and a succinct and secure mechanism to enumerate with the new loop-range feature.
Generalization and reuse are supported by incorporating the new enumeration type using the \CFA trait system.
Enumeration traits define the meaning of an enumeration, allowing functions to be written that work on any enumeration, such as the reading and printing of an enumeration.
With advanced structural typing, C enumerations can be extended so they work with all of the enumeration features, providing for legacy C code to be moved forward into the modern \CFA programming domain.
Finally, the \CFA project's test suite has been expanded with multiple enumeration features tests with respect to implicit conversions, control structures, inheritance, interaction with the polymorphic types, and the features built on top of enumeration traits.
These tests ensure future \CFA work does not accidentally break the new enumeration system.

In summary, the new \CFA enumeration mechanisms achieve the initial goals, providing C programmers with an intuitive enumeration mechanism for handling modern programming requirements.


\section{Future Work}

The following are ideas to improve and extend the work in this thesis.
\begin{enumerate}
\item
There are still corner cases being found in the current \CFA enumeration implementation.
Fixing some of these corner cases requires changes to the \CFA resolver or extensions to \CFA. %, like compile-time constant-expression evaluation.
When these changes are made, it should be straightforward to update the \CFA enumeration implementation to work with them.
\item
Currently, some aspects of the enumeration trait system require explicitly including the file @enum.hfa@, which can lead to problems.
It should be possible to have this file included implicitly by updating the \CFA prelude.
\item
There are multiple \CFA features being developed in parallel with enumerations.
Two closely related features are iterator and namespace.
Enumerations may have to be modified to dovetail with these features.
For example, enumerating with range loops does not align with the current iterator design, so some changes will be necessary.
\item
C already provides @const@-style aliasing using the \emph{unnamed} enumerator \see{\VRef{s:TypeName}}, even if the name @enum@ is misleading (@const@ would be better).
Given the existence of this form, it is conceivable to extend it with types other than @int@.
\begin{cfa}
enum { Size = 20u, PI = 3.14159L, Jack = L"John" };
\end{cfa}
which matches with @const@ aliasing in other programming languages.
Here, the type of the enumerator is the type of the initialization constant, \eg @typeof( 20u )@ for @Size@ implies @unsigned int@.
Auto-initialization is restricted to the case where all constants are @int@, matching with C.
As seen in \VRef{s:EnumeratorTyping}, this feature is just a shorthand for multiple typed-enumeration declarations.
\begin{cfa}
enum( unsigned int ) { Size = 20u };
enum( long double ) { PI = 3.14159L };
enum( wchar_t * ) { Jack = L"John" };
\end{cfa}
\item
Currently, enumeration scoping is all or nothing. In some cases, it might be useful to
increase the scoping granularity to individual enumerators.
\begin{cfa}
enum E1 { @!@A, @^@B, C };
enum E2 @!@ { @!@A, @^@B, C };
\end{cfa}
Here, @'!'@ means the enumerator is scoped, and @'^'@ means the enumerator is unscoped.
For @E1@, @A@ is scoped; @B@ and @C@ are unscoped.
For @E2@, @A@, and @C@ are scoped; @B@ is unscoped.
Finding a use case is important to justify this extension.
\item
An extension mentioned in \VRef{s:Ada} is using @typedef@ to create an enumerator alias.
\begin{cfa}
enum(int) RGB { @Red@, @Green@, Blue };
enum(int) Traffic_Light { @Red@, Yellow, @Green@ };
typedef RGB.Red OtherRed; // alias
\end{cfa}
\item
Label arrays are auxiliary data structures that are always generated for \CFA enumeration, which is a considerable program overhead. 
It is helpful to provide a new syntax or annotation for a \CFA enumeration definition that tells the compiler the labels will not be used 
throughout the execution. Therefore, \CFA optimizes the label array away. The @value()@ function can still be used on an enumeration constant, 
and the function called is reduced to a @char *@ constant expression that holds the name of the enumerator. But if @value()@ is called on 
a variable with an enumerated type, it returns an empty string since the label information is lost for the runtime.
\end{enumerate}