I kind of like your framework of monadic mathematics in that it starts with a larger set of irreducible geometric and algebraic properties (e.g. fullness) so that it is probably a little easier to justify each step why. However, your notion of attaching the "fractal" representation of a number to the number itself seems little more than a half-step towards a computer algorithm. Why not just take the full step and talk just in terms of Numerical Algorithms? Maybe you have some good reason for preferring what seems to me to be a kind of halfway house. Who knows you may even be onto something, and future pedagogy may be based on some rather composite notions such as yours rather than the existing system of proofs which is a little leaner in my estimation.
Good luck getting someone to adopt your system, in say, a school, since that is where you might have to start to get off the ground.