Category Theory for Programmers
by Bartosz Milewski
Publisher: unglue.it 2017
Number of pages: 510
Category theory is the kind of math that is particularly well suited for the minds of programmers. It deals with the kind of structure that makes programs composable. And I will argue strongly that composition is the essence of programming. I will illustrate all major concepts using computer code.
Home page url
Download or read it online for free here:
by Mikael Vejdemo-Johansson - University of St. Andrews
An introduction to category theory that ties into Haskell and functional programming as a source of applications. Topics: definition of categories, special objects and morphisms, functors, natural transformation, (co-)limits and special cases, etc.
by Sen Hu, Xuexing Lu, Yu Ye - arXiv
In this paper, we reveal the combinatorial nature of tensor calculus for strict tensor categories and show that there exists a monad which is described by the coarse-graining of graphs and characterizes the algebraic nature of tensor calculus.
by Andrea Asperti, Giuseppe Longo - MIT Press
Here is an introduction to category theory for the working computer scientist. It is a self-contained introduction to general category theory and the mathematical structures that constitute the theoretical background.
by Emily Riehl - Dover Publications
This is a concise, original text for a one-semester introduction to the subject. The treatment introduces the essential concepts of category theory: categories, functors, natural transformations, the Yoneda lemma, limits and colimits, monads, etc.