It's not functional programming, it's functional languages that go bat shit crazy with the amount of symbols they use that'd make looking at heliographs a refreshing pass time.
We're talking about typed FP so only SML in your list really counts. So let's see: functors, polymorphism, higher-kinded types (does SML have those?), Hindley-Milner type inference, etc. Then for Haskell (the main topic of the linked article), bring in a bunch of unfamiliar algebra such as the notorious monoid on the category of endofunctors. It is actually worth understanding that. I liked this article (prerequisite: some exposure to Haskell):
That’s the way we ought to be working. If you don’t write the DSL, you’ll have to macro-expand the DSL in your head and write a bunch of boilerplate which everyone will be forced to try to reread and maintain forever.
Jtsummers|4 years ago
codr7|4 years ago
jhgb|4 years ago
bigbillheck|4 years ago
throwaway81523|4 years ago
https://www.haskellforall.com/2012/08/the-category-design-pa...
This is also good:
https://en.wikibooks.org/wiki/Haskell/Category_theory
epgui|4 years ago
the_only_law|4 years ago
erik_seaberg|4 years ago