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 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 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 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.