Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1175.68014].
Indexed articles:
Bacci, Giorgio; Danos, Vincent; Kammar, Ohad, On the statistical thermodynamics of reversible communicating processes, 1-18 [Zbl 1344.68160]
Esparza, Javier; Luttenberger, Michael, Solving fixed-point equations by derivation tree analysis, 19-35 [Zbl 1344.68107]
Gupta, Gopal; Saeedloei, Neda; DeVries, Brian; Min, Richard; Marple, Kyle; Kluźniak, Feliks, Infinite computation, co-induction and computational logic, 40-54 [Zbl 1344.68053]
Adámek, Jiří; Haddadi, Mahdieh; Milius, Stefan, From corecursive algebras to corecursive monads, 55-69 [Zbl 1266.18010]
Altenkirch, Thorsten; Morris, Peter; Nordvall Forsberg, Fredrik; Setzer, Anton, A categorical semantics for inductive-inductive definitions, 70-84 [Zbl 1344.68143]
Balan, Adriana; Kurz, Alexander, Finitary functors: from Set to Preord and Poset, 85-99 [Zbl 1343.18001]
Bergfeld, Jort; Venema, Yde, Model constructions for Moss’ coalgebraic logic, 100-114 [Zbl 1343.03048]
Bílková, Marta; Kurz, Alexander; Petrişan, Daniela; Velebil, Jiří, Relation liftings on preorders and posets, 115-129 [Zbl 1343.18003]
Cîrstea, Corina, Model checking linear coalgebraic temporal logics: an automata-theoretic approach, 130-144 [Zbl 1344.68137]
Codescu, Mihai; Mossakowski, Till, Refinement trees: calculi, tools, and applications, 145-160 [Zbl 1344.68144]
Dahlqvist, Fredrik; Pattinson, Dirk, On the fusion of coalgebraic logics, 161-175 [Zbl 1343.03049]
Fumex, Clément; Ghani, Neil; Johann, Patricia, Indexed induction and coinduction, fibrationally, 176-191 [Zbl 1344.68145]
Gabbay, Murdoch J.; Litak, Tadeusz; Petrişan, Daniela, Stone duality for nominal Boolean algebras with {И}, 192-207 [Zbl 1241.68050]
Goncharov, Sergey; Schröder, Lutz, A counterexample to tensorability of effects, 208-221 [Zbl 1287.18006]
Hasuo, Ichiro, The microcosm principle and compositionality of GSOS-based component calculi, 222-236 [Zbl 1344.68134]
Jacobs, Bart, Bases as coalgebras, 237-252 [Zbl 1343.18008]
Kohjina, Jun; Ushio, Toshimitsu; Kinoshita, Yoshiki, A coalgebraic approach to supervisory control of partially observed Mealy automata, 253-267 [Zbl 1343.93056]
Komendantskaya, Ekaterina; Power, John, Coalgebraic semantics for derivations in logic programming, 268-282 [Zbl 1344.68043]
Martins, Manuel A.; Madeira, Alexandre; Diaconescu, Răzvan; Barbosa, Luís S., Hybridization of institutions, 283-297 [Zbl 1343.03052]
Møgelberg, Rasmus Ejlers; Staton, Sam, Linearly-used state in models of call-by-value, 298-313 [Zbl 1344.68040]
Rocha, Camilo; Meseguer, José, Proving safety properties of rewrite theories, 314-328 [Zbl 1344.68142]
Sano, Katsuhiko, Generalized product of coalgebraic hybrid logics, 329-343 [Zbl 1290.03006]
Trancón y Widemann, Baltasar; Hauhs, Michael, Distributive-law semantics for cellular automata and agent-based models, 344-358 [Zbl 1344.68158]
Winter, Joost; Bonsangue, Marcello M.; Rutten, Jan, Context-free languages, coalgebraically, 359-376 [Zbl 1344.68152]
Aceto, Luca; Caltais, Georgiana; Goriac, Eugen-Ioan; Ingolfsdottir, Anna, PREG axiomatizer – a ground bisimilarity checker for GSOS with predicates, 378-385 [Zbl 1344.68199]
Berger, Ulrich; Miyamoto, Kenji; Schwichtenberg, Helmut; Seisenberger, Monika, Minlog – a tool for program extraction supporting algebras and coalgebras, 393-399 [Zbl 1344.68201]
Lantair, Jennifer; Sobociński, Paweł, WiCcA: LTS generation tool for wire calculus, 407-412 [Zbl 1344.68169]