This simplified scheme handles the different ways in which substitution and adjunction can be applied, but treats prediction trees like any other elementary tree.
the function verify tries to establish a correspondence between the k-marked node visits in F 1 and the node visits in G 1 .