@@ -137,7 +137,7 @@ class TypeApplications(val self: Type) extends AnyVal {
137
137
def isSafeLambda (implicit ctx : Context ): Boolean =
138
138
LambdaClass (forcing = false ).exists
139
139
140
- /** Is type `tp` a Lambda with all Arg$ fields fully instantiated? */
140
+ /** Is type `tp` a Lambda with all hk$i fields fully instantiated? */
141
141
def isInstantiatedLambda (implicit ctx : Context ): Boolean =
142
142
isSafeLambda && typeParams.isEmpty
143
143
@@ -211,7 +211,7 @@ class TypeApplications(val self: Type) extends AnyVal {
211
211
}
212
212
case tp : RefinedType =>
213
213
val redux = tp.EtaReduce
214
- if (redux.exists) redux.appliedTo(args) // Rewrite ([HK $0] => C[HK $0])(T) to C[T]
214
+ if (redux.exists) redux.appliedTo(args) // Rewrite ([hk $0] => C[hk $0])(T) to C[T]
215
215
else tp.derivedRefinedType(
216
216
instantiate(tp.parent, original),
217
217
tp.refinedName,
@@ -473,7 +473,7 @@ class TypeApplications(val self: Type) extends AnyVal {
473
473
* - `bounds` consists of type declarations `type hk$i >: toHK(L) <: toHK(U),
474
474
* one for each type parameter in `T` with non-trivial bounds L,U.
475
475
* - `toHK` is a substitution that replaces every bound symbol sym_i by
476
- * `this.Arg $i`.
476
+ * `this.hk $i`.
477
477
*
478
478
* TypeBounds are lambda abstracting by lambda abstracting their upper bound.
479
479
*
@@ -516,7 +516,7 @@ class TypeApplications(val self: Type) extends AnyVal {
516
516
517
517
/** Convert a type constructor `TC` with type parameters `T1, ..., Tn` to
518
518
*
519
- * LambdaXYZ { Apply = TC[$hkArg$ 0, ..., $hkArg $n] }
519
+ * LambdaXYZ { Apply = TC[hk$ 0, ..., hk $n] }
520
520
*
521
521
* where XYZ is a corresponds to the variances of the type parameters.
522
522
*/
@@ -617,8 +617,8 @@ class TypeApplications(val self: Type) extends AnyVal {
617
617
* the type parameters of `B` match one-by-one the variances of `tparams`,
618
618
* and where the lambda abstracted type
619
619
*
620
- * LambdaXYZ { type Apply = B[$hkArg$ 0, ..., $hkArg ${n-1}] }
621
- * { type $hkArg$ 0 = T1; ...; type $hkArg ${n-1} = Tn }
620
+ * LambdaXYZ { type Apply = B[hk$ 0, ..., hk ${n-1}] }
621
+ * { type hk$ 0 = T1; ...; type hk ${n-1} = Tn }
622
622
*
623
623
* satisfies predicate `p`. Try base types in the order of their occurrence in `baseClasses`.
624
624
* A type parameter matches a variance V if it has V as its variance or if V == 0.
0 commit comments