Relative monads formalised
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 comp...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università di Bologna
2014
|
| Online Access: | http://eprints.nottingham.ac.uk/28455/ http://eprints.nottingham.ac.uk/28455/ http://eprints.nottingham.ac.uk/28455/ http://eprints.nottingham.ac.uk/28455/1/relmonform.pdf |