Category theory is a mathematical subject whose importance in several areas of computer science, most notably the semantics of programming languages and the design of programmes using abstract data types, is widely acknowledged. This book introduces category theory at a level appropriate for computer scientists and provides practical examples in the context of programming language design.
Introduction to concepts of category theory — categories, functors, natural transformations, the Yoneda lemma, limits and colimits, adjunctions, monads — revisits a broad range of mathematical examples from the categorical perspective. 2016 edition.
The aim of this book is to explain modern homotopy theory in a manner accessible to graduate students yet structured so that experts can skip over numerous linear developments to quickly reach the topics of their interest. Homotopy theory arises from choosing a class of maps, called weak equivalences, and then passing to the homotopy category by localizing with respect to the weak equivalences, i.e., by creating a new category in which the weak equivalences are isomorphisms. Quillen defined a model category to be a category together with a class of weak equivalences and additional structure useful for describing the homotopy category in terms of the original category. This allows you to make constructions analogous to those used to study the homotopy theory of topological spaces. A model category has a class of maps called weak equivalences plus two other classes of maps, called cofibrations and fibrations. Quillen's axioms ensure that the homotopy category exists and that the cofibrations and fibrations have extension and lifting properties similar to those of cofibration and fibration maps of topological spaces. During the past several decades the language of model categories has become standard in many areas of algebraic topology, and it is increasingly being used in other fields where homotopy theoretic ideas are becoming important, including modern algebraic $K$-theory and algebraic geometry. All these subjects and more are discussed in the book, beginning with the basic definitions and giving complete arguments in order to make the motivations and proofs accessible to the novice. The book is intended for graduate students and research mathematicians working in homotopy theory and related areas.
Category Theory is one of the most abstract branches of mathematics. It is usually taught to graduate students after they have mastered several other branches of mathematics, like algebra, topology, and group theory. It might, therefore, come as a shock that the basic concepts of category theory can be explained in relatively simple terms to anybody with some experience in programming.That's because, just like programming, category theory is about structure. Mathematicians discover structure in mathematical theories, programmers discover structure in computer programs. Well-structured programs are easier to understand and maintain and are less likely to contain bugs. Category theory provides the language to talk about structure and learning it will make you a better programmer.
This book develops abstract homotopy theory from the categorical perspective with a particular focus on examples. Part I discusses two competing perspectives by which one typically first encounters homotopy (co)limits: either as derived functors definable when the appropriate diagram categories admit a compatible model structure, or through particular formulae that give the right notion in certain examples. Emily Riehl unifies these seemingly rival perspectives and demonstrates that model structures on diagram categories are irrelevant. Homotopy (co)limits are explained to be a special case of weighted (co)limits, a foundational topic in enriched category theory. In Part II, Riehl further examines this topic, separating categorical arguments from homotopical ones. Part III treats the most ubiquitous axiomatic framework for homotopy theory - Quillen's model categories. Here, Riehl simplifies familiar model categorical lemmas and definitions by focusing on weak factorization systems. Part IV introduces quasi-categories and homotopy coherence.
This volume provides a series of tutorials on mathematical structures which recently have gained prominence in physics, ranging from quantum foundations, via quantum information, to quantum gravity. These include the theory of monoidal categories and corresponding graphical calculi, Girard’s linear logic, Scott domains, lambda calculus and corresponding logics for typing, topos theory, and more general process structures. Most of these structures are very prominent in computer science; the chapters here are tailored towards an audience of physicists.
Is there a vector space whose dimension is the golden ratio? Of course not—the golden ratio is not an integer! But this can happen for generalizations of vector spaces—objects of a tensor category. The theory of tensor categories is a relatively new field of mathematics that generalizes the theory of group representations. It has deep connections with many other fields, including representation theory, Hopf algebras, operator algebras, low-dimensional topology (in particular, knot theory), homotopy theory, quantum mechanics and field theory, quantum computation, theory of motives, etc. This book gives a systematic introduction to this theory and a review of its applications. While giving a detailed overview of general tensor categories, it focuses especially on the theory of finite tensor categories and fusion categories (in particular, braided and modular ones), and discusses the main results about them with proofs. In particular, it shows how the main properties of finite-dimensional Hopf algebras may be derived from the theory of tensor categories. Many important results are presented as a sequence of exercises, which makes the book valuable for students and suitable for graduate courses. Many applications, connections to other areas, additional results, and references are discussed at the end of each chapter.
