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 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 Daniele Turi - University of Edinburgh
These notes were written for a course in category theory. The course was designed to be self-contained, drawing most of the examples from category theory itself. It was intended for post-graduate students in theoretical computer science.
by Samson Abramsky, Nikos Tzevelekos - arXiv
These notes provide a succinct, accessible introduction to some of the basic ideas of category theory and categorical logic. The main prerequisite is a basic familiarity with the elements of discrete mathematics: sets, relations and functions.
by Paul Goerss, Kristen Schemmerhorn - Northwestern University
There are many ways to present model categories, each with a different point of view. Here we would like to treat model categories as a way to build and control resolutions. We are going to emphasize the analog of projective resolutions.