Logo

Category Theory and Functional Programming

Small book cover: Category Theory and Functional Programming

Category Theory and Functional Programming
by

Publisher: University of St. Andrews
Number of pages: 99

Description:
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:
Read online
(online html)

Similar books

Book cover: Dynamical Systems and SheavesDynamical Systems and Sheaves
by - 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.
(3518 views)
Book cover: A Gentle Introduction to Category Theory: the calculational approachA Gentle Introduction to Category Theory: the calculational approach
by - 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.
(15860 views)
Book cover: Abelian Categories: an Introduction to the Theory of FunctorsAbelian Categories: an Introduction to the Theory of Functors
by - 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.
(9965 views)
Book cover: Combinatorics and Algebra of Tensor CalculusCombinatorics and Algebra of Tensor Calculus
by - 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.
(4125 views)