Please use this identifier to cite or link to this item:
|Title:||Presenting Distributive Laws|
|Authors:||Bonsangue, M. M.|
Hansen, H. H.
Kurz, Alexander Herbert
|Publisher:||IfCoLog (International Federation of Computational Logic)|
|Citation:||Logical Methods In Computer Science, 2015, 11 (3), 2 (23)|
|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.|
|Rights:||Copyright © 2015, the authors. This is an Open Access article distributed under the terms of the Creative Commons Attribution No Derivatives Licence ( http://creativecommons.org/licenses/by-nd/2.0/ ) which permits use and distribution in any medium, provided the original work is properly cited and no modifications or adaptations are made.|
|Appears in Collections:||Published Articles, Dept. of Computer Science|
Files in This Item:
|1503.02447v2.pdf||Published (publisher PDF)||346.88 kB||Adobe PDF||View/Open|
Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.