Generalizing Monads (redux)

[winterkoninkje]

This is a followup to a recent post on Parameterized Monads which I discovered independently, along with everyone else :)

For anyone interested in reading more about them, Oleg Kiselyov also discovered them independently, and developed some Haskell supporting code. Coq supporting code by Matthieu Sozeau is also available. And apparently Robert Atkey investigated them thoroughly in 2006.

If people are interested in more Coq support, I've been working on a Coq library for basic monadic coding in a desperate attempt to make programming (rather than theorem proving) viable in Coq. Eventually I'll post a link to the library which will include parameterized monads as well as traditional monads, applicative functors, and other basic category theoretic goodies. This library along with the Vecs library I never announced stemmed from work last term on proving compiler correctness for a dependently typed language. Hopefully there'll be more news about that this fall.

Comments

[winterkoninkje]

I've looked at it before, though not recently. Honestly, a big part of my library is just for becoming fluent in the quirks and limitations of Coq. I like to have a project to work on in order to learn a language. I don't have any good problems to itch at the moment, so category theory seemed as good a project as any. In that regard it's rather different than the Vecs library which is a practical library to fill an apparently vacant niche.