Relative monads are a generalisation of ordinary monads where the underlying functor need not be an endofunctor. In this paper, we describe a formalisation of the basic theory of relative monads in the interactive theorem prover and dependently typed programming language Agda. The formalisation comprises the requisite basic category theory, the central concepts of the theory of relative monads and adjunctions, which are compared to their ordinary counterparts, and two running examples from programming theory.
@article{4389,
title = {Relative Monads Formalised},
journal = {Journal of Formalized Reasoning},
volume = {7},
year = {2014},
doi = {10.6092/issn.1972-5787/4389},
language = {EN},
url = {http://dml.mathdoc.fr/item/4389}
}
Altenkirch, Thorsten; Chapman, James; Uustalu, Tarmo. Relative Monads Formalised. Journal of Formalized Reasoning, Tome 7 (2014) . doi : 10.6092/issn.1972-5787/4389. http://gdmltest.u-ga.fr/item/4389/