SATySFi VS milewski-ctfp-pdf

https://github.com/gfngfn/SATySFi

SATySFi (pronounced in the same way as the verb “satisfy” in English) is a new typesetting system equipped with a statically-typed, functional programming language. It consists mainly of two “layers” ― the text layer and the program layer. The former is for writing documents in LaTeX-like syntax. The latter, which has OCaml-like syntax, is for defining functions and commands. SATySFi enables you to write documents markuped with flexible commands of your own making. In addition, its informative type error reporting will be a good help to your writing.

The main problem is that a lot of the documentation is in japanese.

There is also SATySFi[1] (another typesetting system in Ocaml), it is active but mainly in japanese.

[1] https://github.com/gfngfn/SATySFi

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.