After nearly two weeks of trying to fit a prism inside of a circle, I've managed to find a comfy balance for the uxntal arity checker. I can now get on with my life.
The validator is able to validate its own source code, which is as convoluted as I can stomach in regards to its own complexity.
Most of uxntal wasn't designed per say, it's more that programming patterns emerged from toying around with the primitives. ie: There never was a notion of "loop".
Due to the absolute lack of planning in terms of programming language design, if you can even call Uxntal a programming language, means that there was never a census of Uxntal's capabilities.
Before putting this together, I don't think I had a good understanding of the actual hidden complexity of the thing.
Type inference was a game of whack a mole, until things started to come together in these past couple of days.