Presenting Distributive Laws
| Autor: | Bonsangue, M.M., Hansen, H.H., Kurz, A., Rot, J.C., Milius, S., Heckel, R. |
|---|---|
| Přispěvatelé: | Milius, S., Heckel, R., Computer Security |
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science General Computer Science Computer science 0102 computer and information sciences 01 natural sciences Operational semantics Theoretical Computer Science Computer Science::Logic in Computer Science Mathematics::Category Theory 0101 mathematics Equivalence (formal languages) Categorical variable GeneralLiterature_REFERENCE(e.g. dictionaries encyclopedias glossaries) Axiom Bisimulation Functor Data Science 010102 general mathematics 16. Peace & justice Logic in Computer Science (cs.LO) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Distributive property 010201 computation theory & mathematics Law TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Lecture Notes in Computer Science |
| Zdroj: | Milius, S.; Heckel, R. (ed.), Algebra and Coalgebra in Computer Science : 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings, 95-109. Berlin : Springer STARTPAGE=95;ENDPAGE=109;ISSN=0302-9743;TITLE=Milius, S.; Heckel, R. (ed.), Algebra and Coalgebra in Computer Science : 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings Logical Methods in Computer Science, 11, 2(1)-2(22) Milius, S.; Heckel, R. (ed.), Algebra and Coalgebra in Computer Science : 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings, pp. 95-109 Logical Methods in Computer Science, 11(3) Logical Methods in Computer Science, 11(3:2), 1-23 Logical Methods in Computer Science, 11, 3, pp. 2(1)-2(22) Logical Methods in Computer Science, 11(3)2015 |
| ISSN: | 0302-9743 1860-5974 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|