• Title: Category Theory for Computing Science
• Author(s) Michael Barr, Charles Wells
• Publisher: Prentice Hall; 1st edition (July 6, 1990); eBook (1998 Edition)
• Hardcover/Paperback: 350 pages
• eBook: PDF (556 pages)
• Language: English
• ISBN-10/ASIN: 0131204866
• ISBN-13: 978-0131204867
• Share This:  

Book Description

This book is a textbook in basic category theory, written specifically to be read by researchers and students in computing science. We expound the constructions we feel are basic to category theory in the context of examples and applications to computing science.

Some categorical ideas and constructions are already used heavily in computing science and we describe many of these uses. Other ideas, in particular the concept of adjoint, have not appeared as widely in the computing science literature.

We give here an elementary exposition of those ideas we believe to be basic categorical tools, with pointers to possible applications when we are aware of them.

In addition, this text advocates a specific idea: the use of sketches as a systematic way to turn finite descriptions into mathematical objects. This aspect of the book gives it a particular point of view.

• N/A

• Amazon

• Category Theory
• Applied Mathematics
• Graph Theory
• Algebra, Abstract Algebra, and Linear Algebra, etc.
• Functional Programming and Lambda
• Database Theory and Systems

• Category Theory for Computing Science (Michael Barr, et al.)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF
• The Mirror Site (3) - PDF

• Computational Category Theory (David E. Rydeheard,, et al.)

  This book is an implementation of concepts and constructions from category theory in the functional programming language Standard ML. It it proceeds from algorithm to algorithm until all of elementary category theory is laid out in precise computational form.

• Category Theory for Programmers (Bartosz Milewski)

  In this category theory for programmers, the author illustrates all major concepts using computer code. You are probably aware that functional languages are closer to math than the more popular imperative languages. They also offer more abstracting power.

• Category Theory: A Programming Language Oriented Introduction

  This book explains the following topics: Categories, functors, natural transformations, String diagrams, Kan extensions, Algebras, coalgebras, bialgebras, Lambda-calculus and categories.

• Category Theory for the Sciences (David I. Spivak)

  Using databases as an entry to Category Theory, this book explains category theory by examples, and shows that category theory can be useful outside of mathematics as a rigorous, flexible, and coherent modeling language throughout the sciences.

• An Invitation to Applied Category Theory: Seven Sketches

  Category theory is now a powerful tool in science, informatics, and industry. This book offers a self-contained tour of applied category theory. Each chapter follows a single thread motivated by a real-world application and discussed with category-theoretic tools.

• Topology: A Categorical Approach (Tai-Danae Bradley, et al)

  A graduate-level textbook that presents basic topology from the perspective of category theory. Many graduate students are familiar with the ideas of point-set topology and they are ready to learn something new about them.

• Basic Category Theory (Tom Leinster)

  Assuming little mathematical background, this short introduction to Category Theory is ideal for beginning graduate students or advanced undergraduates learning category theory for the first time.

• Category Theory in Context (Emily Riehl)

  This book introduces the essential concepts of category theory: categories, functors, natural transformations, the Yoneda lemma, limits and colimits, adjunctions, monads, Kan extensions, and other topics.

• Categories, Types, and Structures (Andrea Asperti, et al)

  This book introduces Category Theory at a level appropriate for computer scientists and provides practical examples in the context of programming language design. It pursues the more complex mathematical semantics of data types and programs.

• Categorical Homotopy Theory (Emily Riehl)

  This book develops abstract homotopy theory from the categorical perspective with a particular focus on examples. It helps consolidate and simplify one's understanding of derived functors, homotopy limits and colimits, and model categories, among others.

• Higher Topos Theory (Jacob Lurie)

  This book presents the foundations of Higher Topos Theory, using the language of weak Kan complexes, and shows how existing theorems in algebraic topology can be reformulated and generalized in the theory's new language.

• Programming in Martin-Lof's Type Theory: An Introduction

  This book focuses on the type theory developed by Per Martin-Lof. It contains a thorough introduction to the Martin-Lof's Type Theory, with information on polymorphic sets, subsets, monomorphic sets, and a full set of helpful examples.