Name
Abstract | ||
|---|---|---|
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 specification of well-behaved structural operational semantics 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 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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-40206-7_9 | conference on algebra and coalgebra in computer science |
DocType | Volume | ISSN |
Conference | abs/1503.02447 | Logical Methods in Computer Science, Volume 11, Issue 3 (August
11, 2016) lmcs:1578 |
Citations | PageRank | References |
1 | 0.37 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcello M. Bonsangue | 1 | 824 | 66.34 |
| Helle Hvid Hansen | 2 | 122 | 14.17 |
| Alexander Kurz | 3 | 204 | 15.76 |
| Jurriaan Rot | 4 | 104 | 18.53 |