Easy TAs

Easy TAs stands for equality constrained tree automata. They are their way to represent the entire space, a program that satisfies some of the strain to being well-tight and then get all of them very efficiently. So we're going from kind of naive synthesis to allow better synthesis by being able to express these things more important than other things.