When speaking about recursive functions, I am wondering if it could be interesting to mention the special case of tail recursion. I have found the tailr package to manage the tail call optimization of these functions, but it does not seem to be maintained anymore.
As I understood, most data structures in R are immutable. Might be interesting to mention it?
When you mention the maybe monad, I would have been interested to see how you manage this in the frame of a pipe, how you can substitute a default value to Nothing(), etc.
Just a few comments reading the page about functional programming, not an issue per se:
maybe
monad, I would have been interested to see how you manage this in the frame of a pipe, how you can substitute a default value to Nothing(), etc.