In the last post, we talked about techniques to implement tail-recursion in F#. We also learned that to write pure functional code we can only use immutable data structures which means we have to implement loop using recursion. Writing recursive function can be cumbersome (e.g., the function has to have one or more base cases) … Continue reading →