Compute realizability status
Constructors
Members
A set of all fields that have already been checked. Used to avoid infinite recursions when analyzing recursive types.
A set of all fields that have already been checked. Used to avoid infinite recursions when analyzing recursive types.
Realizable
if tp
has good bounds, a HasProblemBounds
instance
pointing to a bad bounds member otherwise.
Realizable
if tp
has good bounds, a HasProblemBounds
instance
pointing to a bad bounds member otherwise.
Is symbol's definitition a lazy val? (note we exclude modules here, because their realizability is ensured separately)
Is symbol's definitition a lazy val? (note we exclude modules here, because their realizability is ensured separately)
Realizable
if all of tp
's non-struct fields have realizable types,
a HasProblemField
instance pointing to a bad field otherwise.
Realizable
if all of tp
's non-struct fields have realizable types,
a HasProblemField
instance pointing to a bad field otherwise.
The realizability status of given type tp
The realizability status of given type tp