DeepRead
Cover of Basic category theory for computer scientists

Basic category theory for computer scientists

Benjamin C. Pierce · 1991

Mathematics and physics › Category theory

#2,966 most recommended

About the book

A short introduction to the basic notions of category theory: categories, functors, natural transformations, and universal constructions such as products, coproducts, equalizers, and exponentials. It is written for readers with a computing background rather than a heavy mathematics background, and its scope is limited to the material needed to read work on monads, type theory, and the semantics of programming languages. The central claim is that category theory gives a compact, uniform vocabulary for structures that recur in computer science, so that data types, function spaces, and program composition can all be described with the same few definitions. It develops this through cartesian closed categories, presented as the categorical counterpart of the simply typed lambda calculus. The emphasis is on defining constructions by universal properties, which fix them up to isomorphism, rather than on deep theorems.

Written by Claude from what it knows of this book.

What Hacker News says 86% recommend · 0% critical

02420082015202020252015 peak · 3
This bookAverage book in Category theory

In the commenters’ own words

What Open Library readers say 3.00 from 1 rating

  1. 50
  2. 40
  3. 31
  4. 20
  5. 10
  • 6 want to read
  • 0 reading
  • 1 have read

Only 1 rating: treat the average as a hint.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1991
ISBN
9780262660716
Editions known
2 at Open Library
Open Library
OL4078117W

511.3Categories (Mathematics)Computer scienceComputer science--mathematicsMathematicsQa76.9.m35 p54 1991

Explore in the mosaic

Read next: its neighbours on the mosaic