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 D. I. Spivak, C. Vasilakopoulou, P. Schultz - arXiv
A categorical framework for modeling and analyzing systems in a broad sense is proposed. These systems should be thought of as 'machines' with inputs and outputs, carrying some sort of signal that occurs through some notion of time.
by Maarten M. Fokkinga - University of Twente
These notes present the important notions from category theory. The intention is to provide a fairly good skill in manipulating with those concepts formally. This text introduces category theory in the calculational style of the proofs.
by Peter Freyd - Harper and Row
From the table of contents: Fundamentals (Contravariant functors and dual categories); Fundamentals of Abelian categories; Special functors and subcategories; Metatheorems; Functor categories; Injective envelopes; Embedding theorems.
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.