Monads need not be endofunctors
We introduce a generalization of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, untyped and typed λ-calculus syntax and indexed containers. We show that the Kleisli and Eilenberg-Moore constructions ca...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
International federation of Computer Logic
2015
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/30436/ |