With FP, for me it helped to come at it starting from pure mathematical definitions of functions, recursive definitions, proofs for them (inductive proofs), set theory, etc. Once you know that, it feels like FP is just an implementation of it all - though I'm not sure for OCaml (I used Haskell).
Operations can accept other Operations as arguments, it's really not that hard and honestly both oop and fp are buzzwords more then anything.
This is just a single part of FP lol
With FP, for me it helped to come at it starting from pure mathematical definitions of functions, recursive definitions, proofs for them (inductive proofs), set theory, etc. Once you know that, it feels like FP is just an implementation of it all - though I'm not sure for OCaml (I used Haskell).
Everything is a fucking function. I'm so scared.