Ah thanks. The issues leading to "2-monads" came up recently when doing some programming in Coq and needing to prove that the environments actually do contain what they purport to, so that variables can be safely dereferenced (i.e. proving that I don't need to use the Maybe monad). I've seen ideas similar to this all over the place (e.g. Hinze's Lifting Lemma (http://www.comlab.ox.ac.uk/ralf.hinze/WG2.8//26/slides/ralf.pdf)), hence assuming it's well-known. Not to mention that monoids/categories are utterly ubiquitous.
But considering some of the mysticism around "those ineffable monads", I figured it'd be of general interest (ala the link to Dan's other post). There's much more to axiomatizing "computation" than monads, but people get so hung up on unknown terminology. (And welcome to LJ, Ed :)
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png)
chiming
Re: Indexed and Parameterized Monads
Date: 2010-04-05 11:08 pm (UTC)From:But considering some of the mysticism around "those ineffable monads", I figured it'd be of general interest (ala the link to Dan's other post). There's much more to axiomatizing "computation" than monads, but people get so hung up on unknown terminology. (And welcome to LJ, Ed :)