2015
Presenting Distributive Laws
Publication
Publication
Logical Methods in Computer Science , Volume 11 - Issue 3
Distributive laws of a monad T 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 specication of well-behaved structural operational se-
mantics and, more recently, also for enhancements of the bisimulation proof method. If T
is a free monad, then such distributive laws correspond to simple natural transformations.
However, when T is not free it can be rather dicult to prove the dening 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 dierent representations of
context-free languages.
Additional Metadata | |
---|---|
creative commons | |
Logical Methods in Computer Science | |
Organisation | Computer Security |
Bonsangue, M., Hansen, H., Kurz, A., & Rot, J. (2015). Presenting Distributive Laws. Logical Methods in Computer Science, 11(3). |