Update tests to use new PolyType syntax.

5 files changed, 8 insertions, 8 deletions

diff --git a/tests/pos/i1181c.scala b/tests/pos/i1181c.scala
index 940629259..58bd99766 100644
--- a/tests/pos/i1181c.scala
+++ b/tests/pos/i1181c.scala
@@ -4,7 +4,7 @@ trait Bar[DD[_,_]] {
   val x: DD[Int, Int]
 }
 
-trait Baz extends Bar[[X,Y] -> Foo[X]] {
+trait Baz extends Bar[[X,Y] => Foo[X]] {
   def foo[M[_,_]](x: M[Int, Int]) = x
 
   foo(x)
diff --git a/tests/pos/nestedLambdas.scala b/tests/pos/nestedLambdas.scala
index 58be1ae2f..2e96fa225 100644
--- a/tests/pos/nestedLambdas.scala
+++ b/tests/pos/nestedLambdas.scala
@@ -1,8 +1,8 @@
 class Test {
 
-  type T = [X] -> [Y] -> (X, Y)
+  type T = [X] => [Y] => (X, Y)
 
-  type A[X] = [Y] -> (X, Y)
+  type A[X] = [Y] => (X, Y)
 
   type B[X] = (X, X)
 
diff --git a/tests/pos/t2421_delitedsl.scala b/tests/pos/t2421_delitedsl.scala
index 554702a03..22f1ecd85 100644
--- a/tests/pos/t2421_delitedsl.scala
+++ b/tests/pos/t2421_delitedsl.scala
@@ -15,8 +15,8 @@ trait DeliteDSL {
   import scala.collection.Traversable
   class DeliteCollection[T](val xs: Traversable[T]) {
     // must use existential in bound of P, instead of T itself, because we cannot both have:
-        // Test.x below: DeliteCollection[T=Int] -> P=DeliteInt <: Forcible[T=Int], as T=Int <~< P=DeliteInt
-        // Test.xAlready below: DeliteCollection[T=DeliteInt] -> P=DeliteInt <: Forcible[T=DeliteInt], as T=DeliteInt <~< P=DeliteInt
+        // Test.x below: DeliteCollection[T=Int] => P=DeliteInt <: Forcible[T=Int], as T=Int <~< P=DeliteInt
+        // Test.xAlready below: DeliteCollection[T=DeliteInt] => P=DeliteInt <: Forcible[T=DeliteInt], as T=DeliteInt <~< P=DeliteInt
         // this would required DeliteInt <: Forcible[Int] with Forcible[DeliteInt]
 
     def headProxy[P <: Forcible[_]](implicit w: T <~< P): P = xs.head
diff --git a/tests/pos/tcpoly_bounds1.scala b/tests/pos/tcpoly_bounds1.scala
index 9831e0b99..fc05e18d8 100644
--- a/tests/pos/tcpoly_bounds1.scala
+++ b/tests/pos/tcpoly_bounds1.scala
@@ -7,7 +7,7 @@ object foo extends Foo[MyPair]
 
 
 trait Monad[m[x <: Bound[x]], Bound[x], a] // TODO: variances!
-trait ListMonad[a] extends Monad[List, [X] -> Any, a] // Dotty difference: Any is not a legal argument for hk type.
+trait ListMonad[a] extends Monad[List, [X] => Any, a] // Dotty difference: Any is not a legal argument for hk type.
 
 trait MyOrdered[a]
 trait MySet[x <: MyOrdered[x]]
diff --git a/tests/pos/tcpoly_overloaded.scala b/tests/pos/tcpoly_overloaded.scala
index 573eaadcb..f272590f7 100644
--- a/tests/pos/tcpoly_overloaded.scala
+++ b/tests/pos/tcpoly_overloaded.scala
@@ -11,7 +11,7 @@ trait Monad[T <: Bound[T], MyType[x <: Bound[x]], Bound[_]] {
 
 trait Test {
   def moo: MList[Int]
-  class MList[T](el: T) extends Monad[T, List, [X] -> Any] {
+  class MList[T](el: T) extends Monad[T, List, [X] => Any] {
     def flatMap[S <: RBound[S], RContainer[x <: RBound[x]], RBound[_],
             Result[x <: RBound[x]] <: Monad[x, RContainer, RBound]]
             (f: T => Result[S]): Result[S] = sys.error("foo")
@@ -21,5 +21,5 @@ trait Test {
     def flatMap[S]
             (f: T => List[S], foo: Int): List[S]  = sys.error("foo")
   }
-  val l: MList[String] = moo.flatMap[String, List, [X] -> Any, MList]((x: Int) => new MList("String"))
+  val l: MList[String] = moo.flatMap[String, List, [X] => Any, MList]((x: Int) => new MList("String"))
 }