Dear All, Cambridge University Press just came out with the first in its series <https://www.cambridge.org/core/what-we-publish/elements/elements-in-applied -category-theory> Elements in Applied Category Theory . Theoretical Computer Science for the Working Category Theorist By Noson S. Yanofsky Abstract: Using basic category theory (category, functor, natural transformation, etc.), this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this text, we meet some of the deepest ideas and theorems of modern computers and mathematics, e.g., Turing machines, unsolvable problems, the P=NP question, Kurt Gödel’s incompleteness theorem, intractable problems, Turing’s Halting problem, and much more. The concepts come alive with many examples and exercises. This short text covers the usual material taught in a year-long course. https://www.cambridge.org/core/elements/theoretical-computer-science-for-the -working-category-theorist/5F3499D1F326D2D77567AA1041627699 It will be freely available to access online for the next two weeks. All the best, Noson [For admin and other information see: http://www.mta.ca/~cat-dist/ ]