Department of Computer Science and Technology

Course pages 2019–20

Category Theory

Lecture slides

  • Lecture 1 (10 Oct) Introduction; some history; content of this course. Definition of category. The category of sets and functions. Commutative diagrams. Alternative definitions of category.
  • Lecture 2 (15 Oct) Examples of categories: pre-ordered sets and monotone functions; monoids and monoid homomorphisms; a pre-ordered set as a category; a monoid as a category. Definition of isomorphism.
  • Lecture 3 (17 Oct) Terminal objects. The opposite of a category and the duality principle. Initial objects. Free monoids as initial objects.
  • Lecture 4 (22 Oct) Binary products and coproducts.
  • Lecture 5 (24 Oct) Exponential objects: in the category of sets and in general. Cartesian closed categories: definition and examples.
  • Lecture 6 (29 Oct) Intuitionistic Propositional Logic (IPL) in Natural Deduction style. Semantics of IPL in a cartesian closed pre-ordered set.
  • Lecture 7 (31 Oct) Simply Typed Lambda Calculus (STLC). Semantics of STLC types in a cartesian closed category (ccc).
  • Lecture 8 (5 Nov) Semantics of STLC terms as morphisms in a ccc. Capture-avoiding substitution and its semantics in a ccc.
  • Lecture 9 (7 Nov) Soundness of the ccc semantics for beta-eta equality of lambda terms. The internal language of a ccc. Free cccs. The Curry-Howard-Lawvere/Lambek correspondence.

Exercise sheets

Office hours

  • The module lecturer will be available to answer questions about the course material and exercises on Mondays between 14:00 and 15:00 in FC08 during Full Term.

Additional material