Presenting Distributive Laws

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.

[1]  Marcello M. Bonsangue,et al.  Context-Free Languages, Coalgebraically , 2011, CALCO.

[2]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[3]  F. Bartels,et al.  On Generalised Coinduction and Probabilistic Specification Formats , 2004 .

[4]  Bartek Klin,et al.  Bialgebras for structural operational semantics: An introduction , 2011, Theor. Comput. Sci..

[5]  Alexandra Silva,et al.  Generalizing the powerset construction, coalgebraically , 2010, FSTTCS.

[6]  Bartek Klin.  Adding recursive constructs to bialgebraic semantics , 2004, J. Log. Algebraic Methods Program..

[7]  Bart Jacobs,et al.  Introduction to Coalgebra: Towards Mathematics of States and Observation , 2016, Cambridge Tracts in Theoretical Computer Science.

[8]  Law Fw.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963 .

[9]  Mohammad Reza Mousavi,et al.  Congruence for Structural Congruences , 2005, FoSSaCS.

[10]  Alexandra Silva,et al.  Enhanced coalgebraic bisimulation , 2015, Mathematical Structures in Computer Science.

[11]  S. Lack,et al.  The formal theory of monads II , 2002 .

[12]  Philip S. Mulry,et al.  MONAD COMPOSITIONS I: GENERAL CONSTRUCTIONS AND RECURSIVE DISTRIBUTIVE LAWS , 2007 .

[13]  Stefan Milius.  A Sound and Complete Calculus for Finite Stream Circuits , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[14]  Jan J. M. M. Rutten,et al.  Behavioural differential equations: a coinductive calculus of streams, automata, and power series , 2003, Theor. Comput. Sci..

[15]  Bart Jacobs,et al.  A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages , 2006, Essays Dedicated to Joseph A. Goguen.

[16]  Luca Aceto,et al.  Proving the validity of equations in GSOS languages using rule-matching bisimilarity , 2012, Mathematical Structures in Computer Science.

[17]  Jurriaan Rot,et al.  Combining Bialgebraic Semantics and Equations , 2014, FoSSaCS.

[18]  G. Kelly.  A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on , 1980, Bulletin of the Australian Mathematical Society.

[19]  Bart Jacobs,et al.  Distributive laws for the coinductive solution of recursive equations , 2006, Inf. Comput..

[20]  Eduardo J. Dubuc,et al.  Kan Extensions in Enriched Category Theory , 1970 .

[21]  P. T. Johnstone,et al.  Adjoint Lifting Theorems for Categories of Algebras , 1975 .

[22]  John Power,et al.  Category theory for operational semantics , 2004, Theor. Comput. Sci..

[23]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[24]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[25]  Glynn Winskel,et al.  The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.

[26]  Helle Hvid Hansen,et al.  Pointwise extensions of GSOS-defined operations , 2011, Math. Struct. Comput. Sci..

[27]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[28]  Alexander Kurz,et al.  Equational presentations of functors and monads , 2011, Mathematical Structures in Computer Science.

[29]  J. Wright,et al.  P-varieties - a signature independent characterization of varieties of ordered algebras , 1983 .

[30]  Václav Koubek,et al.  A duality between infinitary varieties and algebraic theories , 2010 .

[31]  F. E. J. Linton,et al.  An outline of functorial semantics , 1969 .

[32]  Jurriaan Rot,et al.  Presenting Distributive Laws , 2013, CALCO.

[33]  Hiroshi Watanabe,et al.  Well-behaved Translations between Structural Operational Semantics , 2002, CMCS.

[34]  Jurriaan Rot,et al.  Coalgebraic Bisimulation-Up-To , 2013, SOFSEM.

[35]  Jan J. M. M. Rutten,et al.  A coinductive calculus of streams , 2005, Mathematical Structures in Computer Science.

[36]  Dirk Pattinson,et al.  Comodels and Effects in Mathematical Operational Semantics , 2013, FoSSaCS.

[37]  John Power,et al.  Combining a monad and a comonad , 2002, Theor. Comput. Sci..