The nice thing about FP is that you can basically copy-paste algorithms direct from academic texts, tweaking only very slightly for syntax. It's this way in Racket, I imagine it's even more easy in Haskell!
That's true. But it's my impression that the terminology used in Haskell in discussing types of functions is different enough to require some study. A Haskell to Scala translation of terminology would be what I'd have to devise for myself.
