This is a follow-up question to Can all math results be formalized and checked by a computer?. Hopefully it's not too broad, but here goes: which subfields of math could be formalized using existing techniques, given infinite time and resources? (By "formalize," I mean "reduce proofs of all known results to abstract string manipulations using rules that are well-specified enough that the manipulations' validity could be checked by a Turing machine.") Obviously there are many well-accepted but nontrivial results whose proof's formalization would be completely infeasible in one lifetime. But are there any fields which we really have no idea how to go about formalizing?
The reason I ask is that one usually sees formalization discussed in the context of discrete math, like number theory. Carl Mummert's answer to the linked question says "Recent developments include completely verified proofs of the Prime Number Theorem (two independent formalizations), the Jordan Curve Theorem, and the Four Color Theorem," and the prime number and four-color theorems naturally fall under discrete mathematics (especially the four-color theorem - the prime-number theorem involves asymptotics, so is perhaps a bit trickier). I get the vague sense that more "continuous" branches of math, like complex analysis, differential geometry, and topology, are more difficult to formalize. (For one thing, if I understand correctly, some statements in number theory only require first-order logic and some require second-order logic, but even rigorously defining the real numbers - let alone proving theorems about them - already requires second-order logic.) Am I correct?