Distributive laws of a monad over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for enhancements of the bisimulation proof method. If is a free monad, then such distributive laws correspond to simple natural transformations. However, when is not free it can be rather difficult to prove the defining axioms of a distributive law. In this paper we describe how to obtain a distributive law for a monad with an equational presentation from a distributive law for the underlying free monad. We apply this result to show the equivalence between two different representations of context-free languages. © 2013 Springer-Verlag Berlin Heidelberg.
Additional Metadata
THEME Software (theme 1)
Publisher Springer
Editor R. Heckel , S. Milius
ISBN 978-3-642-40205-0
Persistent URL dx.doi.org/10.1007/978-3-642-40206-7-9
Series Lecture Notes in Computer Science
Conference Conference on Algebra and Coalgebra in Computer Science
Citation
Bonsangue, M.M, Hansen, H.H, Kurz, A, & Rot, J.C. (2013). Presenting Distributive Laws. In R Heckel & S Milius (Eds.), Lecture Notes in Computer Science. Springer. doi:10.1007/978-3-642-40206-7-9