# Recognisable languages over monads

arXiv: https://arxiv.org/abs/1502.04898 · HTML: https://mlsanity.com/paper/1502.04898/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Feb 2015.

## Built on by (most cited first, 1 of 1)

- [Nominal Topology for Data Languages](https://mlsanity.com/paper/2304.13337/) (2023)

## Abstract (arXiv)

The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of composing structures into bigger structures. It so happens that category theory has an abstract concept for this, namely a monad. The goal of this paper is to propose monads as a unifying framework for discussing existing algebras and designing new algebras.