Recognisable languages over monads
Logic in Computer Science
2015-02-18 v1
Abstract
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.
Cite
@article{arxiv.1502.04898,
title = {Recognisable languages over monads},
author = {Mikołaj Bojańczyk},
journal= {arXiv preprint arXiv:1502.04898},
year = {2015}
}