Basic Category Theory for Computer ScientistsCategory theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Benjamin C. Pierce received his doctoral degree from Carnegie Mellon University.Contents: Tutorial. Applications. Further Reading. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

Review: Basic Category Theory for Computer Scientists
User Review  Tikhon Jelvis  GoodreadsA surprisingly accessible introduction to category theory. It really helped me get a grasp on the different ideas I had seen earlier and filled in some of the parts I hadn't. The book was a bit too ... Read full review
Review: Basic Category Theory for Computer Scientists
User Review  Jakub  GoodreadsWhile this book is an interesting read, it is definitely NOT BASIC. I've had a hard time understanding many of the concepts in the way they're explained, even though this isn't the first thing I've ... Read full review
Contents
Basic Constructions  1 
Functors Natural Transformations and Adjoints  36 
Applications  53 
Further Reading  73 
Bibliography  81 
Summary of Notation  93 