Category Theory for Computing Science
by Michael Barr, Charles Wells
Publisher: Prentice Hall 1998
Number of pages: 544
This book is a textbook in basic category theory, written specifically to be read by researchers and students in computing science. We expound the constructions we feel are basic to category theory in the context of examples and applications to computing science.
Download or read it online for free here:
by Eugenia Cheng, Aaron Lauda - University of Sheffield
This work gives an explanatory introduction to various definitions of higher-dimensional category. The emphasis is on ideas rather than formalities; the aim is to shed light on the formalities by emphasizing the intuitions that lead there.
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.
by D. I. Spivak, C. Vasilakopoulou, P. Schultz - arXiv
A categorical framework for modeling and analyzing systems in a broad sense is proposed. These systems should be thought of as 'machines' with inputs and outputs, carrying some sort of signal that occurs through some notion of time.
by Jacob Lurie - Princeton University Press
Jacob Lurie presents the foundations of higher category theory, using the language of weak Kan complexes, and shows how existing theorems in algebraic topology can be reformulated and generalized in the theory's new language.