skip to main content
Skip header Section
Category TheoryAugust 2010
Publisher:
  • Oxford University Press, Inc.
  • 198 Madison Ave. New York, NY
  • United States
ISBN:978-0-19-923718-0
Published:13 August 2010
Pages:
320
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

Category theory is a branch of abstract algebra with incredibly diverse applications. This text and reference book is aimed not only at mathematicians, but also researchers and students of computer science, logic, linguistics, cognitive science, philosophy, and any of the other fields in which the ideas are being applied. Containing clear definitions of the essential concepts, illuminated with numerous accessible examples, and providing full proofs of all important propositions and theorems, this book aims to make the basic ideas, theorems, and methods of category theory understandable to this broad readership. Although assuming few mathematical pre-requisites, the standard of mathematical rigour is not compromised. The material covered includes the standard core of categories; functors; natural transformations; equivalence; limits and colimits; functor categories; representables; Yoneda's lemma; adjoints; monads. An extra topic of cartesian closed categories and the lambda-calculus is also provided - a must for computer scientists, logicians and linguists!This Second Edition contains numerous revisions to the original text, including expanding the exposition, revising and elaborating the proofs, providing additional diagrams, correcting typographical errors and, finally, adding an entirely new section on monoidal categories. Nearly a hundred new exercises have also been added, many with solutions, to make the book more useful as a course text and for self-study.

Cited By

  1. Bumpus B and Kocsis Z (2023). Spined categories, European Journal of Combinatorics, 114:C, Online publication date: 1-Dec-2023.
  2. Mylnikov L (2023). Process Models in the Management of the Decision Support System Efficiency in Production Systems, Automatic Documentation and Mathematical Linguistics, 10.3103/S0005105523010089, 57:1, (17-30), Online publication date: 1-Feb-2023.
  3. Barcau M, Lupaşcu C, Paşol V and Ţurcaş G Bridges Connecting Encryption Schemes Innovative Security Solutions for Information Technology and Communications, (37-64)
  4. ACM
    Keizer A, Basold H and Pérez J (2022). Session Coalgebras: A Coalgebraic View on Regular and Context-free Session Types, ACM Transactions on Programming Languages and Systems, 44:3, (1-45), Online publication date: 30-Sep-2022.
  5. ACM
    Mio M, Sarkis R and Vignudelli V Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
  6. ACM
    Gratzer D, Cavallo E, Kavvos G, Guatto A and Birkedal L (2022). Modalities and Parametric Adjoints, ACM Transactions on Computational Logic, 23:3, (1-29), Online publication date: 31-Jul-2022.
  7. Goncharov S Shades of Iteration: From Elgot to Kleene Recent Trends in Algebraic Development Techniques, (100-120)
  8. Heerdt G, Kappé T, Rot J, Sammartino M and Silva A A Categorical Framework for Learning Generalised Tree Automata Coalgebraic Methods in Computer Science, (67-87)
  9. ACM
    Holubova I, Contos P and Svoboda M Multi-Model Data Modeling and Representation: State of the Art and Research Challenges Proceedings of the 25th International Database Engineering & Applications Symposium, (242-251)
  10. ACM
    Mio M, Sarkis R and Vignudelli V Combining nondeterminism, probability, and termination Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-14)
  11. Zhang K, Wang Q and Lee Giles C Deep Learning, Grammar Transfer, and Transportation Theory Machine Learning and Knowledge Discovery in Databases, (609-623)
  12. Wang L and Li Q (2020). A logic for Lawson compact algebraic L-domains, Theoretical Computer Science, 813:C, (410-427), Online publication date: 12-Apr-2020.
  13. Milius S, Pattinson D and Wißmann T (2020). A new foundation for finitary corecursion and iterative algebras, Information and Computation, 271:C, Online publication date: 1-Apr-2020.
  14. Breiner S, Jones A and Subrahmanian E (2019). Categorical models for process planning, Computers in Industry, 112:C, Online publication date: 1-Nov-2019.
  15. Sokolov A and Pershin A (2019). Graph-Based Software Framework for Implementation of Complex Computational Methods, Programming and Computing Software, 45:5, (257-267), Online publication date: 1-Sep-2019.
  16. Wißmann T, Dubut J, Katsumata S and Hasuo I Path Category for Free Foundations of Software Science and Computation Structures, (523-540)
  17. ACM
    Kavvos G (2019). Modalities, cohesion, and information flow, Proceedings of the ACM on Programming Languages, 3:POPL, (1-29), Online publication date: 2-Jan-2019.
  18. Saigo H, Naruse M, Okamura K, Hori H, Ojima I and Selişteanu D (2019). Analysis of Soft Robotics Based on the Concept of Category of Mobility, Complexity, 2019, Online publication date: 1-Jan-2019.
  19. Streufert P (2018). The Category of Node-and-Choice Preforms for Extensive-Form Games, Studia Logica, 106:5, (1001-1064), Online publication date: 1-Oct-2018.
  20. Schiendorfer A, Knapp A, Anders G and Reif W (2018). MiniBrass, Constraints, 23:4, (403-450), Online publication date: 1-Oct-2018.
  21. ACM
    Gibbons J, Henglein F, Hinze R and Wu N (2018). Relational algebra by way of adjunctions, Proceedings of the ACM on Programming Languages, 2:ICFP, (1-28), Online publication date: 30-Jul-2018.
  22. ACM
    Boisseau G and Gibbons J (2018). What you needa know about Yoneda: profunctor optics and the Yoneda lemma (functional pearl), Proceedings of the ACM on Programming Languages, 2:ICFP, (1-27), Online publication date: 30-Jul-2018.
  23. ACM
    Elliott C (2018). The simple essence of automatic differentiation, Proceedings of the ACM on Programming Languages, 2:ICFP, (1-29), Online publication date: 30-Jul-2018.
  24. Ma M and Chakraborty M (2018). Covering-based rough sets and modal logics. Part II, International Journal of Approximate Reasoning, 95:C, (113-123), Online publication date: 1-Apr-2018.
  25. ACM
    Leijen D Structured asynchrony with algebraic effects Proceedings of the 2nd ACM SIGPLAN International Workshop on Type-Driven Development, (16-29)
  26. ACM
    Higashino W, Eichler C, Capretz M, Bittencourt L and Monteil T (2016). Attributed Graph Rewriting for Complex Event Processing Self-Management, ACM Transactions on Autonomous and Adaptive Systems, 11:3, (1-39), Online publication date: 20-Sep-2016.
  27. ACM
    Hasuo I, Shimizu S and Cîrstea C (2016). Lattice-theoretic progress measures and coalgebraic model checking, ACM SIGPLAN Notices, 51:1, (718-732), Online publication date: 8-Apr-2016.
  28. ACM
    Pitts A (2016). Nominal techniques, ACM SIGLOG News, 3:1, (57-72), Online publication date: 17-Feb-2016.
  29. ACM
    Hasuo I, Shimizu S and Cîrstea C Lattice-theoretic progress measures and coalgebraic model checking Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (718-732)
  30. ACM
    McCarty L How to ground a language for legal discourse in a prototypical perceptual semantics Proceedings of the 15th International Conference on Artificial Intelligence and Law, (89-98)
  31. Ormandjieva O, Bentahar J, Huang J and Kuang H (2015). Modelling Multi-agent Systems with Category Theory, Procedia Computer Science, 52:C, (538-545), Online publication date: 1-Jan-2015.
  32. Krídlo O and Ojeda-Aciego M (2014). Revising the link between L-Chu correspondences and completely lattice L-ordered sets, Annals of Mathematics and Artificial Intelligence, 72:1-2, (91-113), Online publication date: 1-Oct-2014.
  33. Beheshti R and Sukthankar G Analyzing Agent-Based Models Using Category Theory Proceedings of the 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 02, (280-286)
  34. Wilson W and Phillips S Systematicity, accessibility, and universal properties Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence, (555-566)
  35. Hinze R Kan extensions for program optimisation or Proceedings of the 11th international conference on Mathematics of Program Construction, (324-362)
  36. Knyazhansky M and Plotkin T (2012). Knowledge Bases Over Algebraic Models, International Journal of Knowledge Management, 8:1, (22-39), Online publication date: 1-Jan-2012.
  37. ACM
    Meijer E and Bierman G (2011). A co-relational model of data for large shared data banks, Communications of the ACM, 54:4, (49-58), Online publication date: 1-Apr-2011.
  38. ACM
    Meijer E and Bierman G (2011). A co-Relational Model of Data for Large Shared Data Banks, Queue, 9:3, (30-48), Online publication date: 1-Mar-2011.
  39. Kuang H, Bentahar J, Ormandjieva O, Shafieidizaji N and Klasa S Formal Specification of Substitutability Property for Fault-Tolerance in Reactive Autonomic Systems Proceedings of the 2010 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the 9th SoMeT_10, (357-380)
  40. Solovyov S (2010). From quantale algebroids to topological spaces, Fuzzy Sets and Systems, 161:9, (1270-1287), Online publication date: 1-May-2010.
  41. Hinze R Generic programming with adjunctions Proceedings of the 2010 international spring school conference on Generic and Indexed Programming, (47-129)
Contributors
  • Carnegie Mellon University

Recommendations

William A Fahle

Category theory is a relatively new branch of mathematics involving the study of collections of functions among some objects. As a generalization of group theory, it is a useful topic of study for theoretical computer scientists. Results in category theory will have widespread application to all sorts of common objects. The seminal text on category theory is by Saunders Mac Lane [1]. Awodey's Category theory is a text for the rest of us. It assumes only a basic knowledge of mathematics, such as linear algebra and discrete mathematics. When Awodey introduces other ideas, he provides good basic definitions. Examples are drawn from many areas of mathematics, but they are primarily illustrative and optional for grasping the main ideas of the text. The first chapter defines categories as collections of objects and the arrows (or functions) between those collections. It gives numerous examples. Computer scientists familiar with abstract thinking will have little trouble tackling this section. Subsequent chapters (2 through 6) give theorems based on these definitions and expand the definitions to create abstract algebras of categories. The concept of duality takes up one full chapter, as do the concepts of limits and colimits. The author explores the connection between groups and category theory, and defines and examines exponentials, all leading up to the general theory of categories. A chapter also introduces the concept of naturality, which describes how functions commute and compose, and gives some properties independent of the actual underlying functions. Later chapters cover the categories of diagrams (chapter 8), including the useful Yoneda lemma and its applications. Monads and algebras are discussed in the final chapter (10). The crux of the book appears in the chapter (9) about adjoints. The author claims that adjoints capture an important mathematical aspect of functions and logic that is both fundamental and not captured elsewhere in mathematics. The full definition is given here, and it literally takes the rest of the book to provide all the lead-in definitions, so this section is difficult to summarize. The concepts in this book are at once advanced and fundamental. To the extent that they are fundamental, they are essential to a working computer scientist, and the treatment here is an excellent and methodical introduction. Online Computing Reviews Service

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.