Changes in / [748877f:065de93]

Location:

doc/theses/jiada_liang_MMath

Files:

• CEnum.tex (modified) (5 diffs)
• background.tex (modified) (5 diffs)

doc/theses/jiada_liang_MMath/CEnum.tex

@@ -1 @@
-\chapter{C Enumeration in \CFA}
+\chapter{C Enumeration in CFA}
 
 \CFA supports legacy C enumeration using the same syntax for backwards compatibility. 
-A C-style enumeration in \CFA is called a \newterm{C Enum}.
-The semantics of the C Enum is mostly consistent with C with some restrictions.
-The following sections detail all of my new contributions to C Enums.
-
+C-style Enumeration in \CFA language are called \newterm{C Enumeration} or \newterm{C Enum}.
+The semantics of C Enumeration is mostly consistent with C with more restrictive typing.
+\CFA also extends C Enumeration by adding a number of new features that bring enumerations aligns with other modern programming languages.
+Any enumeration extensions must be intuitive to C programmers both in syntax and semantics.
+The following sections detail all of my new contributions to enumerations in \CFA.
 
 \section{Enumerator Visibility}
@@ -11 +12 @@
 
 In C, unscoped enumerators present a \newterm{naming problem} when multiple enumeration types appear in the same scope with duplicate enumerator names.
+There is no mechanism in C to resolve these naming conflicts other than renaming one of the duplicates, which may be impossible if the conflict comes from system include files.
+
+The \CFA type-system allows extensive overloading, including enumerators.
+Furthermore, \CFA uses the environment, such as the left-hand of assignment and function arguments, to pinpoint the best overloaded name.
+\VRef[Figure]{f:EnumeratorVisibility} shows enumeration overloading and how qualification and casting are used to disambiguate ambiguous situations.
+\CFA overloading allows programmers to use the most meaningful names without fear of name clashes within a program or from external sources, like include files.
+Experience from \CFA developers is that the type system implicitly and correctly disambiguates the majority of overloaded names.
+That is, it is rare to get an incorrect selection or ambiguity, even among hundreds of overloaded variables and functions, that requires disambiguation using qualification or casting.
+
+\begin{figure}
 \begin{cfa}
 enum E1 { First, Second, Third, Fourth };
 enum E2 { @Fourth@, @Third@, @Second@, @First@ }; $\C{// same enumerator names}$
-\end{cfa}
-There is no mechanism in C to resolve these naming conflicts other than renaming one of the duplicates, which may be impossible if the conflict comes from system include files.
-
-The \CFA type-system allows extensive overloading, including enumerators.
-Hence, most ambiguities among C enumerators are implicitly resolved by the \CFA type system, possibly without any programmer knowledge of the conflict.
-In addition, C Enum qualification is added, exactly like aggregate field-qualification, to disambiguate.
-\VRef[Figure]{f:EnumeratorVisibility} shows how resolution, qualification, and casting are used to disambiguate situations for enumerations @E1@ and @E2@.
-
-\begin{figure}
-\begin{cfa}
 E1 f() { return Third; }                                $\C{// overload functions with different return types}$
 E2 f() { return Fourth; }
@@ -41 +42 @@
 \end{figure}
 
+\CFA overloading allows programmers to use the most meaningful names without fear of name clashes within a program or from external sources, like include files.
+Experience from \CFA developers is that the type system implicitly and correctly disambiguates the majority of overloaded names, \ie it is rare to get an incorrect selection or ambiguity, even among hundreds of overloaded variables and functions.
+Any ambiguity can be resolved using qualification or casting.
+
 
 \section{Enumerator Scoping}
 
-A C Enum can be scoped, using @'!'@, so the enumerator constants are not projected into the enclosing scope.
+An enumeration can be scoped, using @'!'@, so the enumerator constants are not projected into the enclosing scope.
 \begin{cfa}
 enum Week @!@ { Mon, Tue, Wed, Thu = 10, Fri, Sat, Sun };
@@ -56 +61 @@
 rgb = @RGB.@Blue;
 \end{cfa}
-% feature unimplemented
-It is possible to toggle back to unscoped using the \CFA @with@ auto-qualification clause/statement (see also \CC \lstinline[language=c++]{using enum} in Section~\ref{s:C++RelatedWork}).
+{\color{red}@***@}It is possible to toggle back to unscoped using the \CFA @with@ clause/statement (see also \CC \lstinline[language=c++]{using enum} in Section~\ref{s:C++RelatedWork}).
 \begin{cfa}
 with ( @Week@, @RGB@ ) {                                $\C{// type names}$
@@ -66 +70 @@
 As in Section~\ref{s:EnumeratorVisibility}, opening multiple scoped enumerations in a @with@ can result in duplicate enumeration names, but \CFA implicit type resolution and explicit qualification/casting handle this localized scenario.
 
-
 \section{Type Safety}
 
 As in Section~\ref{s:Usage}, C's implicit bidirectional conversion between enumeration and integral type raises a safety concern.
-In \CFA, the conversion is changed to unidirectional: an enumeration can be implicitly converted into an integral type, with an associated @safe@ conversion cost.
-But an integral type cannot be implicitly converted into a C enumeration because the conversion cost is set to @infinity@.
+In \CFA, the conversion is unidirectional: 
+% disallows an implicit conversion from integral type to enumeration, and conversion between different C enumeration type.
+% It loses some degree of its backward compatibility to C, in exchange for type safety.
+an enumeration can be implicitly converted into an integral type, with an associated @safe@ conversion cost.
+But an integral type cannot be implicitly converted into a C enumeration. (Conversion Cost is Infinity.)
 \begin{cfa}
-enum Bird { Penguin, Robin, Eagle };
+enum Bird { Pengin, Robin, Eagle };
 enum Fish { Shark, Salmon, Whale };
 
-int i = Robin;                                                  $\C{// allow, implicitly converts to 1}$ 
-enum Bird @bird = 1;@                                   $\C{// disallow }$ 
-enum Bird @bird = Shark;@                               $\C{// disallow }$ 
+int i = Robin; $\C{// Allow, implicitly converts to 1}$ 
+@enum Bird bird = Shark;@ $\C{// Disallow }$ 
+@enum Bird bird = 1;@  $\C{// Disallow }$ 
 \end{cfa}
-It is now up to the programmer to insert an explicit cast to force the assignment.
+As a workaround, \CFA allows an explicit cast to an enumeration, turning an integral type to an enumeration that can be used in assignment or function argument, 
+in which case \CFA treats C enuemration as its underlying integral type. In such cases, it is up to user to ensure program correctness.
 \begin{cfa}
-enum Bird bird = @(Bird)@1;
-enum Bird bird = @(Bird)@Shark 
+@enum Bird bird = (Bird) Shark@ 
+@enum Bird bird = (Bird) 1;@ 
 \end{cfa}
-
-Note, \CC has the same safe restriction~\cite[C.1.5.7.2]{C++} and provides the same workaround cast.
-\begin{description}[parsep=0pt]
-\item[Change:] \CC objects of enumeration type can only be assigned values of the same enumeration type.
-In C, objects of enumeration type can be assigned values of any integral type.
-Example:
-\begin{cfa}
-enum color { red, blue, green };
-color c = 1;                            $\C{// valid C, invalid \CC}$
-\end{cfa}
-\item[Rationale:] The type-safe nature of \CC.
-\item[Effect on original feature:] Deletion of semantically well-defined feature.
-\item[Difficulty of converting:] Syntactic transformation. (The type error produced by the assignment can be
-automatically corrected by applying an explicit cast.)
-\item[How widely used:] Common.
-\end{description}
-
-\begin{comment}
-\begin{description}[parsep=0pt]
-\item[Change:] In \CC, the type of an enumerator is its enumeration.
-In C, the type of an enumerator is @int@.
-Example:
-\begin{cfa}
-enum e { A };
-sizeof(A) == sizeof(int)        $\C{// in C}$
-sizeof(A) == sizeof(e)          $\C{// in \CC}$
-/* and sizeof(int) is not necessary equal to sizeof(e) */
-\end{cfa}
-\item[Rationale:] In \CC, an enumeration is a distinct type.
-\item[Effect on original feature:] Change to semantics of well-defined feature.
-\item[Difficulty of converting:] Semantic transformation.
-\item[How widely used:] Seldom. The only time this affects existing C code is when the size of an enumerator is
-taken. Taking the size of an enumerator is not a common C coding practice.
-\end{description}
-\end{comment}

doc/theses/jiada_liang_MMath/background.tex

@@ -240 +240 @@
 \section{\CFA}
 
-\CFA in \emph{not} an object-oriented programming-language, \ie functions cannot be nested in aggregate types, and hence, there is no \newterm{receiver} notation for calling functions, \eg @obj.method(...)@, where the first argument proceeds the call and becomes an  implicit first (\lstinline[language=C++]{this}) parameter.
-The following sections provide short descriptions of \CFA features needed further in the thesis.
-Other \CFA features are presented in-situ with short explanations, or no explanation because the feature is obvious to C programmers.
-
-
-\subsection{Overloading}
-
-Overloading allows programmers to use the most meaningful names without fear of name clashes within a program or from external sources, like include files.
-\begin{quote}
-There are only two hard things in Computer Science: cache invalidation and naming things. --- Phil Karlton
-\end{quote}
-Experience from \CC and \CFA developers is that the type system implicitly and correctly disambiguates the majority of overloaded names, \ie it is rare to get an incorrect selection or ambiguity, even among hundreds of overloaded (variables and) functions.
-In many cases, a programmer has no idea there are name clashes, as they are silently resolved, simplifying the development process.
-Depending on the language, ambiguous cases are resolved using some form of qualification or casting.
+\CFA in \emph{not} an object-oriented programming-language, \ie functions cannot be nested in aggregate types, and hence, there is no receive notation for calling functions, \eg @obj.method(...)@, where the first argument proceeds the call.
+The following section provide short descriptions of \CFA features mentioned further in the thesis.
 
 
@@ -285 +273 @@
 Here, there is a perfect match for the call, @f( 'A' )@ with the number and parameter type of function (2).
 
-Ada, Scala, and \CFA type-systems also use the return type in resolving a call, to pinpoint the best overloaded name.
+Ada, Scala, and \CFA type-systems also use the return type in resolving a call.
 \begin{cfa}
 int f( void );                  $\C[1.75in]{// (4); overloaded on return type}$
@@ -308 +296 @@
 \end{cfa}
 The \CFA type system simply treats overloaded variables as an overloaded function returning a value with no parameters.
-Hence, no significant effort is required to support this feature.
 
 
@@ -321 +308 @@
 
 The prototype for the constructor/destructor are @void ?{}( T &, ... )@ and @void ^?{}( T &, ... )@, respectively.
-The first parameter is logically, the \lstinline[language=C++]{this} or \lstinline[language=Python]{self} in other object-oriented languages, and implicitly passed.
-\VRef[Figure]{f:CFAConstructorDestructor} shows an example of creating and using a constructor and destructor.
-Both constructor and destructor can be explicitly called to reuse a variable.
-
-\begin{figure}
+The first parameter is logically, the \lstinline[language=C++]{this} or \lstinline[language=java]{self} in other object-oriented languages, and implicitly passed.
 \begin{cfa}
 struct Employee {
@@ -331 +314 @@
         double salary;
 };
-void @?{}@( Employee & emp, char * nname, double nsalary ) with( emp ) { // auto qualification
-        name = aalloc( sizeof(nname) );
-        strcpy( name, nname );
-        salary = nsalary;
-}
-void @^?{}@( Employee & emp ) {
-        free( emp.name );
+void @?{}@( Employee & this, char * name, double salary ) {
+        this.name = aalloc( sizeof(name) );
+        strcpy( this.name, name );
+        this.salary = salary;
+}
+void @^?{}@( Employee & this ) {
+        free( this.name );
 }
 {
-        Employee emp = { "Sara Schmidt", 20.5 }; $\C{// initialize with implicit constructor call}$
-        ... // use emp
-        ^?{}( emp ); $\C{// explicit de-initialize}$
-        ?{}( emp, "Jack Smith", 10.5 ); $\C{// explicit re-initialize}$
-        ... // use emp
-} $\C{// de-initialize with implicit destructor call}$
-\end{cfa}
-\caption{\CFA Constructor and Destructor}
-\label{f:CFAConstructorDestructor}
-\end{figure}
+        Employee name = { "Sara Schmidt", 20.5 };
+} // implicit destructor call
+\end{cfa}
+Both constructor and destructor can be explicitly called.
+\begin{cfa}
+        Employee name = { "Sara Schmidt", 20.5 };
+        ... // use name
+        ^?{}( name ); // de-initialize
+        ?{}( name, "Jack Smith", 10.5 }; // re-initialize
+        ... // use name
+\end{cfa}