Simplify MT reduction algorithm

By removing the widenAbstractTypes step, which is subsumed by the
provably empty test.

Author: OlivierBlanvillain

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

@@ -2757,34 +2757,6 @@ class TrackingTypeComparer(initctx: Context) extends TypeComparer(initctx) {
         case _ =>
           cas
       }
-      def widenAbstractTypes(tp: Type): Type = new TypeMap {
-        var seen = Set[TypeParamRef]()
-        def apply(tp: Type) = tp match {
-          case tp: TypeRef =>
-            tp.info match {
-              case info: MatchAlias =>
-                mapOver(tp)
-                  // TODO: We should follow the alias in this case, but doing so
-                  // risks infinite recursion
-              case TypeBounds(lo, hi) =>
-                if (hi frozen_<:< lo) {
-                  val alias = apply(lo)
-                  if (alias ne lo) alias else mapOver(tp)
-                }
-                else WildcardType
-              case _ =>
-                mapOver(tp)
-            }
-          case tp: TypeLambda =>
-            val saved = seen
-            seen ++= tp.paramRefs
-            try mapOver(tp)
-            finally seen = saved
-          case tp: TypeVar if !tp.isInstantiated => WildcardType
-          case tp: TypeParamRef if !seen.contains(tp) => WildcardType
-          case _ => mapOver(tp)
-        }
-      }.apply(tp)
 
       val defn.MatchCase(pat, body) = cas1
 
@@ -2799,8 +2771,6 @@ class TrackingTypeComparer(initctx: Context) extends TypeComparer(initctx) {
               body
           }
         }
-      else if (isSubType(widenAbstractTypes(scrut), widenAbstractTypes(pat)))
-        Some(NoType)
       else if (provablyDisjoint(scrut, pat))
         // We found a proof that `scrut` and `pat` are incompatible.
         // The search continues.

tests/neg/6314-6.scala

@@ -0,0 +1,57 @@
+final class X
+final class Y
+
+object Test3 {
+  type Bar[A] = A match {
+    case X => String
+    case Y => Int
+  }
+
+  trait XX {
+    type Foo
+
+    val a: Bar[X & Foo] = "hello"
+    val b: Bar[Y & Foo] = 1
+
+    def apply(fa: Bar[X & Foo]): Bar[Y & Foo]
+
+    def boom: Int = apply(a)
+  }
+
+  trait YY extends XX {
+    type Foo = X & Y
+
+    def apply(fa: Bar[X & Foo]): Bar[Y & Foo] = fa // error
+        // overriding method apply in trait XX of type (fa: String): Int;
+        //   method apply of type (fa: String): String has incompatible type
+  }
+  (new YY {}).boom
+}
+
+object Test4 {
+  type Bar[A] = A match {
+    case X => String
+    case Y => Int
+  }
+
+  trait XX {
+    type Foo
+    type FooAlias = Foo
+
+    val a: Bar[X & FooAlias] = "hello"
+    val b: Bar[Y & FooAlias] = 1
+
+    def apply(fa: Bar[X & FooAlias]): Bar[Y & FooAlias]
+
+    def boom: Int = apply(a)
+  }
+
+  trait YY extends XX {
+    type Foo = X & Y
+
+    def apply(fa: Bar[X & FooAlias]): Bar[Y & FooAlias] = fa // error
+        // overriding method apply in trait XX of type (fa: String): Int;
+        //   method apply of type (fa: String): String has incompatible type
+  }
+  (new YY {}).boom
+}

tests/neg/6314.scala

@@ -46,53 +46,3 @@ object Test2 {
     def right(fa: Bar[L]): Int = fa // error
   }
 }
-
-
-object Test3 {
-  type Bar[A] = A match {
-    case X => String
-    case Y => Int
-  }
-
-  trait XX {
-    type Foo
-
-    val a: Bar[X & Foo] = "hello"
-    val b: Bar[Y & Foo] = 1 // error
-
-    def apply(fa: Bar[X & Foo]): Bar[Y & Foo]
-
-    def boom: Int = apply(a) // error
-  }
-
-  trait YY extends XX {
-    type Foo = X & Y
-
-    def apply(fa: Bar[X & Foo]): Bar[Y & Foo] = fa
-  }
-}
-
-object Test4 {
-  type Bar[A] = A match {
-    case X => String
-    case Y => Int
-  }
-
-  trait XX {
-    type Foo
-    type FooAlias = Foo
-
-    val a: Bar[X & FooAlias] = "hello"
-    val b: Bar[Y & FooAlias] = 1 // error
-
-    def apply(fa: Bar[X & FooAlias]): Bar[Y & FooAlias]
-
-    def boom: Int = apply(a) // error
-  }
-
-  trait YY extends XX {
-    type Foo = X & Y
-
-    def apply(fa: Bar[X & FooAlias]): Bar[Y & FooAlias] = fa
-  }
-}