peds VS milewski-ctfp-pdf

Or lets look at persistent data structures, a staple of functional programming:

https://github.com/tobgu/peds

Notice how you'd need to generate the DS for every type you'd like to use it, which is not the case with built in mutable maps and slices.

To make them type-safe, you need to generate them for every type you use. While this is technically possible, it does make the language quite hostile towards functional programming. With generics, this is rectified but the problem with non-composable multi-return-value functions still remains

One of the library types that benefits from having generics is "data structure" libraries. Does anyone know of work going on to make a Go 1.18+ persistent data structure library (something like this or this)?

Category Theory for Programmers by Bartosz Milewski (https://github.com/hmemcpy/milewski-ctfp-pdf/releases)

Strangely similar name to the well-known 'Category Theory for Programmers'

https://github.com/hmemcpy/milewski-ctfp-pdf

There's this, but the programmer doesn't have to be working:

https://bartoszmilewski.com/2014/10/28/category-theory-for-p...

Milewski's "Category Theory for Programmers".

(3) category theory. I was never advised to read any, but found that bartosz's introduction really good. https://bartoszmilewski.com/2014/10/28/category-theory-for-programmers-the-preface/. Helps to rewire the brain.

It's also possible to model programming languages using category theory, but I know less about that. If you're interested in following this up, then Benjamin Pierce has what I'm told is a good introduction to category theory for computer scientists, and Bartosz Milweski has an online book (it might be available in hard copy as well, I'm not sure) called Category Theory for Programmers. I believe simple programming languages like the simply typed lambda calculus end up being modelled as Cartesian closed categories.