Category Theory and Functional Programming
by Mikael Vejdemo-Johansson
Publisher: University of St. Andrews 2012
Number of pages: 99
This text is intended to provide an introduction to Category Theory that ties into Haskell and functional programming as a source of examples and applications. Topics covered: The definition of categories, special objects and morphisms, functors, natural transformation, (co-)limits and special cases of these, adjunctions, freeness and presentations as categorical constructs, monads and Kleisli arrows, recursion with categorical constructs.
Home page url
Download or read it online for free here:
by Daniele Turi - University of Edinburgh
These notes were written for a course in category theory. The course was designed to be self-contained, drawing most of the examples from category theory itself. It was intended for post-graduate students in theoretical computer science.
by Takahiro Kato - viXra.org
Modules and morphisms among them subsume categories and functors and provide more general framework to explore the theory of structures. In this book we generalize the basic notions and results of category theory using this framework of modules.
by Paul Goerss, Kristen Schemmerhorn - Northwestern University
There are many ways to present model categories, each with a different point of view. Here we would like to treat model categories as a way to build and control resolutions. We are going to emphasize the analog of projective resolutions.
by Tom Leinster - arXiv
This introduction to category theory is for readers with relatively little mathematical background. At its heart is the concept of a universal property, important throughout mathematics. For each new concept a generous supply of examples is provided.