---
title: "Basic Category Theory for Computer Scientists"
authors:
  - "Benjamin C. Pierce"
year: 1991
venue: "MIT Press"
arxiv: null
doi: null
source: "https://mitpress.mit.edu/9780262660716/basic-category-theory-for-computer-scientists/"
topics:
  - category-theory
  - plt
  - pierce
seed_rank: 34
seed_batch: "prefill-2026-08-13"
reviewed: "2026-08-13"
pool: "languages"
relevance_score: 10
cites:
  - title: "Categories for the Working Mathematician (2nd ed.)"
    url: "https://doi.org/10.1007/978-1-4757-4721-8"
    year: 1998
    arxiv: null
    doi: "10.1007/978-1-4757-4721-8"
  - title: "Category Theory for Computing Science"
    url: "https://www.math.mcgill.ca/barr/papers/ctcs.pdf"
    year: 1995
    arxiv: null
    doi: null
  - title: "Physics, Topology, Logic and Computation: A Rosetta Stone"
    url: "https://arxiv.org/abs/0903.0340"
    year: 2011
    arxiv: "0903.0340"
    doi: "10.1007/978-3-642-12821-9_2"
see:
  - "029-categories-for-the-working-mathematician-2nd-ed"
  - "138-category-theory-for-computing-science"
  - "018-physics-topology-logic-and-computation-a-rosetta-stone"
---

# Basic Category Theory for Computer Scientists

## One-sentence takeaway

Pierce’s 1991 MIT Press primer is a thin, CS-first walk through categories, functors, natural transformations, products/exponentials, and cartesian closed categories — the right density before TAPL or Mac Lane.

## Why it matters here

This is the on-ramp Anoptic language notes assume: enough CCC to see why typed λ is an internal language, not enough to drown a working compiler writer.

## Key ideas

- Objects and arrows first, with programming examples (types and terms, sets and functions, posets) rather than algebraic topology.
- Functors and natural transformations are motivated as “structure-preserving maps” and “coherent families of maps,” the vocabulary needed to read Moggi and Lambek.
- Products, coproducts, exponentials, and the definition of a cartesian closed category are the payoff chapter — the bridge to typed lambda calculi.
- Adjoints and limits are sketched, not developed to Mac Lane depth; the book is deliberately ~80–100 pages.
- MIT Press Foundations of Computing series, ISBN 978-0-262-66071-6; no commonly cited book DOI.

## Caveats

## Links

- MIT Press: https://mitpress.mit.edu/9780262660716/basic-category-theory-for-computer-scientists/