wip: lattice overhaul step 3: simplify lattice comparisons

Author: aviatesk

base/compiler/abstractinterpretation.jl

@@ -1696,7 +1696,7 @@ function abstract_eval_statement(interp::AbstractInterpreter, @nospecialize(e),
                 end
                 if !anyrefine
                     anyrefine = has_nontrivial_const_info(at) || # constant information
-                                at ⋤ ft                          # just a type-level information, but more precise than the declared type
+                                at ⋤ₜ ft                         # just a type-level information, but more precise than the declared type
                 end
                 ats[i-1] = at
             end

base/compiler/typelattice.jl

@@ -473,20 +473,20 @@ The non-strict partial order over the type inference lattice.
 end
 
 """
-    a ⊏ b -> Bool
+    a::LatticeElement ⊏ b::LatticeElement -> Bool
 
 The strict partial order over the type inference lattice.
 This is defined as the irreflexive kernel of `⊑`.
 """
-@nospecialize(a) ⊏ @nospecialize(b) = a ⊑ b && !⊑(b, a)
+a::LatticeElement ⊏ b::LatticeElement = a ⊑ b && !⊑(b, a)
 
 """
-    a ⋤ b -> Bool
+    a::LatticeElement ⋤ b::LatticeElement -> Bool
 
 This order could be used as a slightly more efficient version of the strict order `⊏`,
 where we can safely assume `a ⊑ b` holds.
 """
-@nospecialize(a) ⋤ @nospecialize(b) = !⊑(b, a)
+a::LatticeElement ⋤ b::LatticeElement = !⊑(b, a)
 
 a::LatticeElement ⊑ₜ @nospecialize(b#=::Type=#) = widenconst(a) <: b
 a::LatticeElement ⊏ₜ @nospecialize(b#=::Type=#) = widenconst(a) <: b && !(b <: widenconst(a))