Derives the static type of a policy expression without evaluating it, pushing any certain type error onto problems.
problems
A literal's lexical form is checked against its declared datatype here. Where the type cannot be known the answer is null rather than a guess.
a model expression node
the variable definitions in scope
the list each problem found is appended to
{ kind, type } with kind 'primitive', 'bag' or 'function' (a null type meaning of some type it cannot name), or null when unknown
{ kind, type }
type
Derives the static type of a policy expression without evaluating it, pushing any certain type error onto
problems.A literal's lexical form is checked against its declared datatype here. Where the type cannot be known the answer is null rather than a guess.