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 Peter Freyd - Harper and Row
From the table of contents: Fundamentals (Contravariant functors and dual categories); Fundamentals of Abelian categories; Special functors and subcategories; Metatheorems; Functor categories; Injective envelopes; Embedding theorems.
by Marc Levine - American Mathematical Society
This book combines foundational constructions in the theory of motives and results relating motivic cohomology to more explicit constructions. Prerequisite for understanding the work is a basic background in algebraic geometry.
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 Jacob Lurie - Harvard University
Contents: Stable infinite-Categories; infinite-Operads; Algebras and Modules over infinte-Operads; Associative Algebras and Their Modules; Little Cubes and Factorizable Sheaves; Algebraic Structures on infinite-Categories; and more.