Recursion can run afoul of stack overflow errors if we are not careful to make our functions tail-recursive. But tail recursion is not enough if we want to use monadic recursion, or abstractions like free monads and free monad transformers. In this talk, I'll show how we are able to make these techniques safe in PureScript, a strict Haskell-like language that compiles to JavaScript.
Target audience:
- PureScript programmers, or any Haskell programmers who would like to translate their skills to some other strict language
Phil writes Haskell for a living, and maintains the PureScript compiler and many of its libraries for fun.
Github: paf31
Twitter: @paf31