![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
15th CMCS 2020: Dublin, Ireland (Part of ETAPS 2020)
- Daniela Petrisan, Jurriaan Rot:
Coalgebraic Methods in Computer Science - 15th IFIP WG 1.3 International Workshop, CMCS 2020, Colocated with ETAPS 2020, Dublin, Ireland, April 25-26, 2020, Proceedings. Lecture Notes in Computer Science 12094, Springer 2020, ISBN 978-3-030-57200-6 - Nathanaël Fijalkow
:
The Theory of Universal Graphs for Games: Past and Future. 1-10 - Jirí Adámek:
Approximate Coalgebra Homomorphisms and Approximate Solutions. 11-31 - Nick Bezhanishvili
, Sebastian Enqvist, Jim de Groot
:
Duality for Instantial Neighbourhood Logic via Coalgebra. 32-54 - H. Peter Gumm:
Free-Algebra Functors from a Coalgebraic Perspective. 55-67 - Gerco van Heerdt
, Matteo Sammartino
, Alexandra Silva
:
Learning Automata with Side-Effects. 68-89 - Bart Jacobs, Sam Staton:
De Finetti's Construction as a Categorical Limit. 90-111 - Yuichi Komorida
:
Injective Objects and Fibered Codensity Liftings. 112-132 - Barbara König
, Christina Mika-Michalski, Lutz Schröder
:
Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas. 133-154 - Stelios Tsampas
, Andreas Nuyts
, Dominique Devriese
, Frank Piessens
:
A Categorical Approach to Secure Compilation. 155-179 - Vladimir Zamdzhiev:
Semantics for First-Order Affine Inductive Data Types via Slice Categories. 180-200
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.