Resources for learning practical category theory

Online resources:

• The Catsters channel
• MATH198 course notes - examples in Haskell
• Rydehard, Burstall: Computional Category Theory - examples in ML (free reprint of a book)
• MAGIC course
• Barr, Wells: Category theory for computing science (TAC TR22 is a free reprint of the book)
• Jaap van Oosten: basic category theory
• Tom Leinster
• Eugenia Cheng
• Steve Awodey - very similar to the book mentioned by Quadrescence
• Daniele Turi
• Thomas Streicher
• Abstract and concrete categories: the joy of cats - might be considered too verbose, but it's full of examples; slightly newer (?) version as TAC TR17
• Spivak: Category Theory for Scientists - free textbook of a 2013 MIT OpenCourseWare; an updated (and non-free) version was published by MIT Press in 2014.
• Emily Riehl: Category Theory in Context

Books (not free):

• Benjamin Pierce: Basic category theory for computer scientists, MIT Press 1991; a slight expansion/update of the earlier (and free) CMU-CS-88-203 report
• MacLane - solid mathematical foundations, but hardly any references to computing
• Martin Brandenburg - Einführung in die Kategorientheorie (in german)

Category theory in Haskell:

• Wikibooks introductory text
• sigfpe's blog has a lot of category theory articles - (di)natural transformations, monads, Yoneda lemma...
• Comonad.Reader
• The Monad.Reader - check "Calculating monads with category theory"
• Bartosz Milewski - Category Theory for Programmers

Another list

Since sdvccv already pointed out a number of good sources for learning category theory as applied to CS, I will try and provide some guide posts.

My favorite book on the subject is Practical Foundations of Mathematics by Paul Taylor since he does a really good job of giving you a big picture (unfortunately he doesn't always give you enough details if you don't already have a logic background). Bart Jacobs book Categorical Logic and Type Theory is also very readable.

In general I think the most important thing to understand in order to apply categories to computer science is the Curry-Howard-Lambek correspondence which loosely states that lambda calculii, intuitionist logics, and cartesian closed categories (categories where you have products and function spaces) are the same thing. Proofs and Types which was transcribed from some of Girard's lecture notes is an excellent source for the Curry-Howard part of the correspondence. Steve Awodey's book and these notes by Samson Abramsky are good places to see this translated into categorical language. For connections to Topoi Mac Lane's Sheaves in Geometry and Logic looks good.

Next you will probably want to learn about categorical and universal algebra. One of the more immediate and accessible applications of these ideas is the theory of algebraic data types (categorically: initial algebras for polynomial functors) and maps and folds between them. Monads are also a part of this subject since they are type constructors (endofunctors) that also have a multiplication and unit. Haskell do notation corresponds to forming the Kliesli category for a monad.

The nascent field of universal coalgebra has been very useful for formalizing notions of state and observation. There are also some emerging connections between coalgebra and modal logic.

Finally, if you aren't worn out you may want to learn about Stone duality which is a way of relating "logics of observable properties" and topology. For computer scientist Stone duality is primarily useful for giving a logical interpretation to domain theory, but mathematicians may recognize the duality between commutative rings and Zariski spectra as a special case.

Category Theory by Steve Awodey from Carnegie Mellon University has been a favorite text of mine. It's 266 pages, and while it's not a "practical theory book" (e.g., one aimed at programmers), it is very easy to follow and very well explained.