mirror of
https://github.com/dart-lang/sdk
synced 2024-09-16 02:27:39 +00:00
Add missing clause for LUB(Bottom, T)
BUG= R=paulberry@google.com Review URL: https://codereview.chromium.org//1179113010.
This commit is contained in:
parent
696fbdf440
commit
b34c19d0ce
|
@ -7510,7 +7510,8 @@ where $depth(T)$ is the number of steps in the longest inheritance path from $T$
|
|||
\LMHash{}
|
||||
The least upper bound of \DYNAMIC{} and any type $T$ is \DYNAMIC{}.
|
||||
The least upper bound of \VOID{} and any type $T \ne \DYNAMIC{}$ is \VOID{}.
|
||||
Let $U$ be a type variable with upper bound $B$. The least upper bound of $U$ and a type $T$ is the least upper bound of $B$ and $T$.
|
||||
The least upper bound of $\bot$ and any type $T$ is $T$.
|
||||
Let $U$ be a type variable with upper bound $B$. The least upper bound of $U$ and a type $T \ne \bot$ is the least upper bound of $B$ and $T$.
|
||||
|
||||
\LMHash{}
|
||||
The least upper bound relation is symmetric and reflexive.
|
||||
|
|
Loading…
Reference in a new issue