* make sure (decompose t) builds a cyclic 'v' object if t is a recursive type.
 * add a memoization environment to substitute_aux to detect and rebuild such cycles in the new 'v' object.
 * use solve everywhere to build a cycle type (this basically implements Courcelle's algorithm at the level of types.