[ninetyninenine]

>I think I find a lot of FP code harder to both write and read (even code I've written myself), but when the FP code is written and compiles, it is much more likely to be correct.

You're probably thinking about haskell. It's like this because of the type checking combined with the FP makes haskell especially robust.

That being said FP is programming nivana. The FP function is the most modular unit of computation in CS. By writing an FP program composed of functions you have broken down all sections of your program into the smallest form by definition.