Relative monads formalised

Altenkirch, Thorsten and Chapman, James and Uustalu, Tarmo (2014) Relative monads formalised. Journal of Formalized Reasoning, 7 (1). pp. 1-43. ISSN 1972-5787

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (305kB) | Preview

Abstract

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.

Item Type: Article
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.6092/issn.1972-5787/4389
Depositing User: Altenkirch, Thorsten
Date Deposited: 02 Mar 2015 12:58
Last Modified: 13 Sep 2016 14:52
URI: http://eprints.nottingham.ac.uk/id/eprint/28455

Actions (Archive Staff Only)

Edit View Edit View