address feedback

Author: bishabosha

compiler/test/dotty/tools/dotc/CompilationTests.scala

@@ -52,7 +52,6 @@ class CompilationTests {
       compileFile("tests/pos-special/notNull.scala", defaultOptions.and("-Yexplicit-nulls")),
       compileDir("tests/pos-special/adhoc-extension", defaultOptions.and("-source", "3.1", "-feature", "-Xfatal-warnings")),
       compileFile("tests/pos-special/i7575.scala", defaultOptions.andLanguageFeature("dynamics")),
-      compileFile("tests/pos-special/i10511-transitivity.scala", defaultOptions), // avoid pickling test
       compileFile("tests/pos-special/kind-projector.scala", defaultOptions.and("-Ykind-projector")),
       compileFile("tests/run/i5606.scala", defaultOptions.and("-Yretain-trees")),
       compileFile("tests/pos-custom-args/i5498-postfixOps.scala", defaultOptions withoutLanguageFeature "postfixOps"),

docs/docs/reference/new-types/match-types.md

@@ -48,7 +48,7 @@ Recursive match type definitions can also be given an upper bound, like this:
 
 ```scala
 type Concat[Xs <: Tuple, +Ys <: Tuple] <: Tuple = Xs match
-   case Unit => Ys
+   case EmptyTuple => Ys
    case x *: xs => x *: Concat[xs, Ys]
 ```
 
@@ -126,6 +126,7 @@ Disjointness proofs rely on the following properties of Scala types:
 1. Single inheritance of classes
 2. Final classes cannot be extended
 3. Constant types with distinct values are nonintersecting
+4. Singleton paths to distinct values are nonintersecting, such as `object` definitions or singleton enum cases.
 
 Type parameters in patterns are minimally instantiated when computing `S <: Pi`.
 An instantiation `Is` is _minimal_ for `Xs` if all type variables in `Xs` that
@@ -240,4 +241,3 @@ main differences here are:
    whereas match types also work for type parameters and abstract types.
  - Match types support direct recursion.
  - Conditional types distribute through union types.
-

tests/pos-special/i10511-transitivity.scala

@@ -14,3 +14,9 @@ val t: True.type = True
 val f: False.type = False
 
 val g: Not[False.type] = t
+
+val t1: Not[f.type] = t // transitivity
+val f1: Not[t.type] = f // transitivity
+
+val t2: Not[f1.type] = t1 // transitivity x2
+val f2: Not[t1.type] = f1 // transitivity x2