How to Write a Tree Automata for Haskell Programs

The older approaches for these huge basic programs are vern space algorithms and eGrace. And I actually Bruce, these are approximately a subset of something else called tree automata. So you can write a tree automata for all Haskell programs or all Haskell expressions or any subset of Haskell or many other languages. There's a really nice thing about tree automata is that we found that they're kind of like more general than i.e. space algebra's or e-drass. They also are very theoretically nice in all this rich history of atomic theory behind them. The use TA is that something can encode added to qualities, which in the case of a well typedness is kind of