aboutsummaryrefslogtreecommitdiff
path: root/tests/pos/lookuprefined.scala
Commit message (Collapse)AuthorAgeFilesLines
* Introduce recursive typesMartin Odersky2016-07-111-2/+4
| | | | | | | | | | | | | | | | | Map self-references in refinements to recursive types. This commit does this for refinement types appearing in source. We still have to do it for unpickled refinements. Test apply-equiv got moved to pending because it simulates the old higher-kinded type encoding in source, which relies on the old representation in terms of self-referential refinement types. The plan is not to adapt this encoding to the new representation, but to replace it with a different encoding that makes critical use of the added power of recursive types. Use recursive types also when unpickling from Scala 2.x. Add mapInfo method to Denotations.
* Handling higher-kinded types with lambdasMartin Odersky2014-06-181-0/+8
Switch to the new scheme where higher-kinded types (and also some polymorphic type aliases) are represented as instances of Lambda traits.