Basic Category Theory for Computer Scientists

Front Cover
MIT Press, 1991 - Computers - 100 pages
16 Reviews

Category 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
1
4 stars
8
3 stars
4
2 stars
3
1 star
0

Review: Basic Category Theory for Computer Scientists

User Review  - Tikhon Jelvis - Goodreads

A 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 - Goodreads

While 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
Copyright

Common terms and phrases

Popular passages

Page 88 - In DH Pitt, DE Rydeheard, P. Dybjer, AM Pitts, and A. Poigne, editors, Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science, pages 118,127.
Page 91 - EG Wagner), Rational algebraic theories and fixed point solutions, in Proceedings 17th IEEE Symposium on Foundations of Computer Science, Houston, Texas (1976).
Page 87 - In Maurice Nivat and John C. Reynolds, editors, Algebraic Methods in Semantics, pages 237-250.

References to this book

Categories for Types
Roy L. Crole
Limited preview - 1993
All Book Search results »

About the author (1991)

Benjamin C. Pierce is Professor of Computer and Information Science at the University of Pennsylvania.

Bibliographic information