Print Email Facebook Twitter Presenting distributive laws Title Presenting distributive laws Author Bonsangue, M.M. Hansen, H.H. Kurz, A. Rot, J. Faculty Technology, Policy and Management Department Engineering, Systems and Services Date 2015-12-31 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. To reference this document use: http://resolver.tudelft.nl/uuid:1b5fd112-2240-4a63-9194-91a3e4eef535 Publisher IfCoLoq ISSN 1860-5974 Source Logical Methods in Computer Science, 11(3)2015 Part of collection Institutional Repository Document type journal article Rights (c) 2015 The AuthorsPublished under CC 2.0 Files PDF 323088.pdf 346.88 KB Close viewer /islandora/object/uuid:1b5fd112-2240-4a63-9194-91a3e4eef535/datastream/OBJ/view