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 Sen Hu, Xuexing Lu, Yu Ye - arXiv
In this paper, we reveal the combinatorial nature of tensor calculus for strict tensor categories and show that there exists a monad which is described by the coarse-graining of graphs and characterizes the algebraic nature of tensor calculus.
by Jaap van Oosten - University of Utrecht
Contents: Categories and Functors; Natural transformations; (Co)cones and (Co)limits; A little piece of categorical logic; Adjunctions; Monads and Algebras; Cartesian closed categories and the lambda-calculus; Recursive Domain Equations.
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.
by Jacob Lurie - Princeton University Press
Jacob Lurie presents the foundations of higher category 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.