Fix subtyping to match DOT rule TDECL-<:

Author: smarter

src/dotty/tools/dotc/core/TypeComparer.scala

@@ -736,8 +736,12 @@ class TypeComparer(initctx: Context) extends DotClass {
   def fourthTry(tp1: Type, tp2: Type): Boolean = tp1 match {
     case tp1: TypeRef =>
       tp1.info match {
-        case TypeBounds(lo1, hi1) =>
-          isSubType(hi1, tp2)
+        case TypeBounds(lo1, hi1) => tp2 match {
+          case tp2: NamedType if tp1.name == tp2.name =>
+            isSubType(tp1.info, tp2.info)
+          case _ =>
+            isSubType(hi1, tp2)
+        }
         case _ =>
           (tp1.symbol eq NothingClass) && tp2.isInstanceOf[ValueType] ||
           (tp1.symbol eq NullClass) && tp2.dealias.typeSymbol.isNullableClass

test/dotc/tests.scala

@@ -52,6 +52,7 @@ class tests extends CompilerTest {
   @Test def pos_approximateUnion = compileFile(posDir, "approximateUnion", doErase)
   @Test def pos_tailcall = compileDir(posDir + "tailcall/", doErase)
   @Test def pos_nullarify = compileFile(posDir, "nullarify", "-Ycheck:nullarify" :: doErase)
+  @Test def pos_subtyping = compileFile(posDir, "subtyping", doErase)
 
   @Test def pos_all = compileFiles(posDir, twice)
   @Test def new_all = compileFiles(newDir, twice)

tests/pos/subtyping.scala

@@ -0,0 +1,15 @@
+class C1
+class C2 extends C1
+class C3 extends C2
+class C4 extends C3
+
+object Test {
+  // Test DOT rule TDECL-<:
+  def test_typebounds(): Unit = {
+    val c31 : { type T >: C3 <: C1 } = ???
+    val c41 : { type T >: C4 <: C1 } = ???
+    val c42 : { type T >: C4 <: C2 } = ???
+    implicitly[c31.T <:< c41.T]
+    implicitly[c42.T <:< c41.T]
+  }
+}