Extreme types, helper functions

Author: eernstg

specification/dartLangSpec.tex

@@ -5393,7 +5393,12 @@ \subsection{Combined Member Signatures}
 
 \LMHash{}%
 Let \mall{} be the result of applying \TopMergeTypeName{} to
-the elements in \Mall.
+\NormalizedTypeOfName{} of the elements in \Mall.
+\commentary{%
+Note that these types are mutual subtypes,
+and hence the normalized forms are structurally identical,
+modulo different choices of top type in some locations.%
+}
 The combined member signature is then $m'$,
 which is obtained from \mall{} by adding the modifier \COVARIANT{}
 to each parameter $p$ (if it is not already present)
@@ -22024,6 +22029,8 @@ \subsection{Functions Dealing with Extreme Types}
 \LMHash{}%
 The functions are syntactic in nature such that termination is obvious.
 In particular, they do not rely on subtyping.
+In each of these function definitions,
+the first applicable case must be used.
 
 \LMHash{}%
 The \Index{\TopMergeTypeName} of two types computes
@@ -22038,10 +22045,10 @@ \subsection{Functions Dealing with Extreme Types}
 \item \DefEquals{\TopMergeType{\VOID}{\VOID}}{\code{\VOID}}.
 \item \DefEquals{\TopMergeType{Object?}{\VOID}}{\code{Object?}}, and\\
   \DefEquals{\TopMergeType{\VOID}{Object?}}{\code{Object?}}.
-\item \DefEquals{\TopMergeType{\DYNAMIC}{\VOID}}{\code{Object?}}, and\\
-  \DefEquals{\TopMergeType{\VOID}{\DYNAMIC}}{\code{Object?}}
 \item \DefEquals{\TopMergeType{Object?}{\DYNAMIC}}{\code{Object?}}, and\\
   \DefEquals{\TopMergeType{\DYNAMIC}{Object?}}{\code{Object?}}.
+\item \DefEquals{\TopMergeType{\DYNAMIC}{\VOID}}{\code{Object?}}, and\\
+  \DefEquals{\TopMergeType{\VOID}{\DYNAMIC}}{\code{Object?}}
 \item \DefEquals{\TopMergeType{$T$?}{$S$?}}{\code{\TopMergeType{$T$}{$S$}?}}.
 \item For all other types, the function is applied recursively.
 
@@ -22058,6 +22065,9 @@ \subsection{Functions Dealing with Extreme Types}
 Note that \TopMergeTypeName{} is not defined for
 types which are structurally different,
 apart from being or containing different top types.
+When \TopMergeTypeName{} is used in this specification,
+each case where \TopMergeTypeName{} is undefined
+is handled explicitly.%
 }
 
 \rationale{%
@@ -22068,7 +22078,10 @@ \subsection{Functions Dealing with Extreme Types}
 }
 
 \commentary{%
-For instance, if a class $C$ inherits a method $m$ that accepts
+For instance, \TopMergeTypeName{} is used during the computation of
+the interface of a class member which is declared
+in multiple superinterfaces.
+If a class $C$ inherits a method $m$ that accepts
 an argument of type \code{List<\DYNAMIC>} from one superinterface,
 and another method $m$ that accepts
 an argument of type \code{List<\VOID>}
@@ -22082,7 +22095,8 @@ \subsection{Functions Dealing with Extreme Types}
 \TopMergeTypeName{} of more than two types is defined by taking
 \TopMergeTypeName{} of the first two,
 and then recursively taking \TopMergeTypeName{} of the rest.
-
+\commentary{The ordering of the arguments makes no difference.}
+  
 \LMHash{}%
 The \Index{\IsTopTypeName} predicate is true for any type which is in
 the equivalence class of top types.
@@ -22097,7 +22111,7 @@ \subsection{Functions Dealing with Extreme Types}
 \item \DefEquals{\IsTopType{$T$}}{\metavar{false}}, otherwise.
 \end{itemize}
 
-\LMHash{}%
+\noindent
 The \Index{\IsObjectTypeName} predicate is true if{}f 
 the argument is a subtype and a supertype of \code{Object}.
 
@@ -22107,7 +22121,7 @@ \subsection{Functions Dealing with Extreme Types}
 \item \DefEquals{\IsObjectType{$T$}}{\metavar{false}}, otherwise.
 \end{itemize}
 
-\LMHash{}%
+\noindent
 The \Index{\IsBottomTypeName} predicate is true if{}f
 the argument is a subtype of \code{Never}.
 
@@ -22118,7 +22132,7 @@ \subsection{Functions Dealing with Extreme Types}
 \item \DefEquals{\IsBottomType{$T$}}{\metavar{false}}, otherwise.
 \end{itemize}
 
-\LMHash{}%
+\noindent
 The \Index{\IsNullTypeName} predicate is true if{}f
 the argument is a subtype and a supertype of \code{Null}.
 
@@ -22128,7 +22142,7 @@ \subsection{Functions Dealing with Extreme Types}
 \item \DefEquals{\IsNullType{$T$}}{\metavar{false}}, otherwise.
 \end{itemize}
 
-\LMHash{}%
+\noindent
 The \Index{\IsMoreTopTypeName} predicate defines a total order on
 top and \code{Object} types.
 
@@ -22146,7 +22160,7 @@ \subsection{Functions Dealing with Extreme Types}
   \IsMoreTopType{$T$}{$S$}}.
 \end{itemize}
 
-\LMHash{}%
+\noindent
 The \Index{\IsMoreBottomTypeName} predicate defines an almost total order on
 bottom and \code{Null} types.
 \commentary{%
@@ -22171,8 +22185,6 @@ \subsection{Functions Dealing with Extreme Types}
   \IsMoreBottomType{$T$}{$S$}}.
 \end{itemize}
 
-!!!TODO!!! Clean up this section: We should say that these definitions are used in order (first applicable case must be used). We should specify the acceptable arguments is each case, and argue that we're never calling them on anything which is not acceptable.
-
 
 \subsection{Type Normalization}
 \LMLabel{typeNormalization}