For every goal configuration c derived by LTF or LTL, the AM dependency tree described by c is well-typed.
we also consider a transition system in which the lexical type is chosen after deciding on the outgoing edges.