Flexible Presentations of Graded Monads
summary
Defines a flexibly graded presentation that permits operations whose arguments carry different grades and proves two concrete claims: every such presentation yields a canonical graded monad (terms modulo the equational logic) equipped with algebraic operations that interpret ops like choice fail and cut, and every graded monad satisfying a mild colimit condition arises from one of these presentations, preserving the usual algebra–monad correspondence.
AI-written summary · about