A type application
C[T_1, ..., T_n]
Compute hashcode relative to enclosing binders
Equality used for hash-consing; uses
eq on all recursive invocations,
except where a BindingType is involved. The latter demand a deep isomorphism check.
this isomorphic to
that, assuming pairs of matching binders
It is assumed that
hash of this type the same for all possible sequences of enclosing binders?
The closest supertype of this type. This is the same as
- instead of a TyperBounds type it returns its upper bound, and
- for applied types it returns the upper bound of the constructor re-applied to the arguments.
Same as superType, except that opaque types are treated as transparent aliases
If this type can be normalized at the top-level by rewriting match types of S[n] types, the result after applying all toplevel normalizations, otherwise NoType