Programming Languages Based on Category Theory

There's Charity.


Yes. I think that Haskell is the canonical example. Go here for more.


Haskell is a purely functional language. However side-effects are (almost by definition) difficult to incorporate into a functional language. This is an important problem since I/O is a very important side-effect for most computer programs. Haskell's method of incorporating side-effects is to use monads.

One of the simplest ways to get a monad is from a pair of adjoint functors.

For more on monads see:

(1) Embûches tissues blog: Monads in Mathematics 1: examples

(2) A series of lectures on youtube by TheCatsters:

Pairs of adjoint functors are fairly common and I've found they provide a useful way for seeing part of the "big-picture" in many different branches of mathematics.

Here is one of several introductions to pairs of adjoint functors from the Concrete Nonsense blog.

Tags:

Computer Science

Ct.Category Theory

Related

Cubical vs. simplicial singular homology When are probability distributions completely determined by their moments? Do convolution and multiplication satisfy any nontrivial algebraic identities? Are there two non-isomorphic number fields with the same degree, class number and discriminant? Is a subgroup of a free abelian group free abelian? Probabilistic knot theory Are there two non-diffeomorphic smooth manifolds with the same homology groups? Relationship between universal coefficient theorem and $[K(\mathbb{Z},n), K(G,n)]$? When does direct image with proper support have a right adjoint? Are there two groups which are categorically Morita equivalent but only one of which is simple Potential connected non-Lie subgroup Hopf algebra structure on the universal enveloping algebra of a Leibniz algebra?

Recent Posts