7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Proceedings{bonchi_et_al:LIPIcs.CALCO.2017, title = {{LIPIcs, Volume 72, CALCO'17, Complete Volume}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017}, URN = {urn:nbn:de:0030-drops-82059}, doi = {10.4230/LIPIcs.CALCO.2017}, annote = {Keywords: Theory of Computation, Models of computation, Logics and Meanings of Programs, Semantics of Programming Languages – Algebraic Approach} }
7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bonchi_et_al:LIPIcs.CALCO.2017.0, author = {Bonchi, Filippo and K\"{o}nig, Barbara}, title = {{Front Matter, Table of Contents, Preface, List of Authors}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {0:i--0:x}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.0}, URN = {urn:nbn:de:0030-drops-80284}, doi = {10.4230/LIPIcs.CALCO.2017.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, List of Authors} }
Alex Simpson. Probability Sheaves and the Giry Monad. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 1:1-1:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{simpson:LIPIcs.CALCO.2017.1, author = {Simpson, Alex}, title = {{Probability Sheaves and the Giry Monad}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {1:1--1:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.1}, URN = {urn:nbn:de:0030-drops-80517}, doi = {10.4230/LIPIcs.CALCO.2017.1}, annote = {Keywords: Random variable, conditional independence, category theory, sheaves, Giry monad} }
Alessandro Gianola, Stefano Kasangian, and Nicoletta Sabadini. Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gianola_et_al:LIPIcs.CALCO.2017.2, author = {Gianola, Alessandro and Kasangian, Stefano and Sabadini, Nicoletta}, title = {{Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.2}, URN = {urn:nbn:de:0030-drops-80535}, doi = {10.4230/LIPIcs.CALCO.2017.2}, annote = {Keywords: Categories, Automata, Composition, Networks} }
Jiri Adámek and Stefan Milius. On Corecursive Algebras for Functors Preserving Coproducts. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{adamek_et_al:LIPIcs.CALCO.2017.3, author = {Ad\'{a}mek, Jiri and Milius, Stefan}, title = {{On Corecursive Algebras for Functors Preserving Coproducts}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.3}, URN = {urn:nbn:de:0030-drops-80298}, doi = {10.4230/LIPIcs.CALCO.2017.3}, annote = {Keywords: terminal coalgebra, free algebra, corecursive algebra, hyper-extensive category} }
Zeinab Bakhtiari and Helle Hvid Hansen. Bisimulation for Weakly Expressive Coalgebraic Modal Logics. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 4:1-4:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bakhtiari_et_al:LIPIcs.CALCO.2017.4, author = {Bakhtiari, Zeinab and Hvid Hansen, Helle}, title = {{Bisimulation for Weakly Expressive Coalgebraic Modal Logics}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.4}, URN = {urn:nbn:de:0030-drops-80500}, doi = {10.4230/LIPIcs.CALCO.2017.4}, annote = {Keywords: Coalgebraic modal logic, bisimulation, expressiveness, Hennessy-Milner theorem} }
Henning Basold, Damien Pous, and Jurriaan Rot. Monoidal Company for Accessible Functors. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{basold_et_al:LIPIcs.CALCO.2017.5, author = {Basold, Henning and Pous, Damien and Rot, Jurriaan}, title = {{Monoidal Company for Accessible Functors}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.5}, URN = {urn:nbn:de:0030-drops-80379}, doi = {10.4230/LIPIcs.CALCO.2017.5}, annote = {Keywords: coalgebras, distributive laws, accessible functors, monoidal categories} }
Harsh Beohar and Sebastian Küpper. On Path-Based Coalgebras and Weak Notions of Bisimulation. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{beohar_et_al:LIPIcs.CALCO.2017.6, author = {Beohar, Harsh and K\"{u}pper, Sebastian}, title = {{On Path-Based Coalgebras and Weak Notions of Bisimulation}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.6}, URN = {urn:nbn:de:0030-drops-80362}, doi = {10.4230/LIPIcs.CALCO.2017.6}, annote = {Keywords: Paths, Executions, Branching bisimulation, Coalgebras} }
Corina Cirstea, Shunsuke Shimizu, and Ichiro Hasuo. Parity Automata for Quantitative Linear Time Logics. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{cirstea_et_al:LIPIcs.CALCO.2017.7, author = {Cirstea, Corina and Shimizu, Shunsuke and Hasuo, Ichiro}, title = {{Parity Automata for Quantitative Linear Time Logics}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {7:1--7:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.7}, URN = {urn:nbn:de:0030-drops-80468}, doi = {10.4230/LIPIcs.CALCO.2017.7}, annote = {Keywords: coalgebra, quantitative logic, linear time logic, parity automaton} }
Thomas Colcombet and Daniela Petrisan. Automata Minimization: a Functorial Approach. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{colcombet_et_al:LIPIcs.CALCO.2017.8, author = {Colcombet, Thomas and Petrisan, Daniela}, title = {{Automata Minimization: a Functorial Approach}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.8}, URN = {urn:nbn:de:0030-drops-80484}, doi = {10.4230/LIPIcs.CALCO.2017.8}, annote = {Keywords: functor automata, minimization, Choffrut's minimization algorithm, subsequential transducers, Brzozowski's minimization algorithm} }
Fredrik Dahlqvist and Alexander Kurz. The Positivication of Coalgebraic Logics. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 9:1-9:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{dahlqvist_et_al:LIPIcs.CALCO.2017.9, author = {Dahlqvist, Fredrik and Kurz, Alexander}, title = {{The Positivication of Coalgebraic Logics}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {9:1--9:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.9}, URN = {urn:nbn:de:0030-drops-80425}, doi = {10.4230/LIPIcs.CALCO.2017.9}, annote = {Keywords: Coalgebraic logic, coalgebras, enriched category theory, boolean algebra, distributive lattice, positive modal logic, monotone modal logic} }
Clovis Eberhart and Tom Hirschowitz. Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{eberhart_et_al:LIPIcs.CALCO.2017.10, author = {Eberhart, Clovis and Hirschowitz, Tom}, title = {{Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.10}, URN = {urn:nbn:de:0030-drops-80407}, doi = {10.4230/LIPIcs.CALCO.2017.10}, annote = {Keywords: Concurrency, Sheaves, Presheaf models, Game Semantics} }
Sebastian Enqvist and Yde Venema. Disjunctive Bases: Normal Forms for Modal Logics. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{enqvist_et_al:LIPIcs.CALCO.2017.11, author = {Enqvist, Sebastian and Venema, Yde}, title = {{Disjunctive Bases: Normal Forms for Modal Logics}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.11}, URN = {urn:nbn:de:0030-drops-80357}, doi = {10.4230/LIPIcs.CALCO.2017.11}, annote = {Keywords: Modal logic, fixpoint logic, automata, coalgebra, graded modal logic, Lyndon theorem, uniform interpolation} }
Brendan Fong and Fabio Zanasi. A Universal Construction for (Co)Relations. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{fong_et_al:LIPIcs.CALCO.2017.12, author = {Fong, Brendan and Zanasi, Fabio}, title = {{A Universal Construction for (Co)Relations}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.12}, URN = {urn:nbn:de:0030-drops-80334}, doi = {10.4230/LIPIcs.CALCO.2017.12}, annote = {Keywords: corelation, prop, string diagram} }
William John Gowers and James Laird. Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gowers_et_al:LIPIcs.CALCO.2017.13, author = {Gowers, William John and Laird, James}, title = {{Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {13:1--13:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.13}, URN = {urn:nbn:de:0030-drops-80454}, doi = {10.4230/LIPIcs.CALCO.2017.13}, annote = {Keywords: Game Semantics, Stateful Languages, Transfinite Games, Sequoid Operator} }
Tomás Jakl and Achim Jung. Free Constructions and Coproducts of d-Frames. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jakl_et_al:LIPIcs.CALCO.2017.14, author = {Jakl, Tom\'{a}s and Jung, Achim}, title = {{Free Constructions and Coproducts of d-Frames}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {14:1--14:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.14}, URN = {urn:nbn:de:0030-drops-80304}, doi = {10.4230/LIPIcs.CALCO.2017.14}, annote = {Keywords: Free construction, d-frame, coproduct, C-ideals} }
Alexander Knapp and Till Mossakowski. UML Interactions Meet State Machines - An Institutional Approach. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{knapp_et_al:LIPIcs.CALCO.2017.15, author = {Knapp, Alexander and Mossakowski, Till}, title = {{UML Interactions Meet State Machines - An Institutional Approach}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.15}, URN = {urn:nbn:de:0030-drops-80346}, doi = {10.4230/LIPIcs.CALCO.2017.15}, annote = {Keywords: UML, state machines, interactions, composite structure diagrams, institutions, multi-view consistency} }
Harald König and Uwe Wolter. Being Van Kampen in Presheaf Topoi is a Uniqueness Property. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{konig_et_al:LIPIcs.CALCO.2017.16, author = {K\"{o}nig, Harald and Wolter, Uwe}, title = {{Being Van Kampen in Presheaf Topoi is a Uniqueness Property}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {16:1--16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.16}, URN = {urn:nbn:de:0030-drops-80320}, doi = {10.4230/LIPIcs.CALCO.2017.16}, annote = {Keywords: Van Kampen Cocone, Presheaf Topos, Fibred Semantics, Mapping Path} }
Dan Marsden and Fabrizio Genovese. Custom Hypergraph Categories via Generalized Relations. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{marsden_et_al:LIPIcs.CALCO.2017.17, author = {Marsden, Dan and Genovese, Fabrizio}, title = {{Custom Hypergraph Categories via Generalized Relations}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.17}, URN = {urn:nbn:de:0030-drops-80494}, doi = {10.4230/LIPIcs.CALCO.2017.17}, annote = {Keywords: Process Theory, Categorical Compositional Semantics, Generalized Relations, Hypergraph Category, Compact Closed Category} }
Stefan Milius. Proper Functors and their Rational Fixed Point. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{milius:LIPIcs.CALCO.2017.18, author = {Milius, Stefan}, title = {{Proper Functors and their Rational Fixed Point}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.18}, URN = {urn:nbn:de:0030-drops-80314}, doi = {10.4230/LIPIcs.CALCO.2017.18}, annote = {Keywords: proper functor, proper semiring, coalgebra, rational fixed point} }
David Reutter and Jamie Vicary. A Classical Groupoid Model for Quantum Networks. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 19:1-19:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{reutter_et_al:LIPIcs.CALCO.2017.19, author = {Reutter, David and Vicary, Jamie}, title = {{A Classical Groupoid Model for Quantum Networks}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {19:1--19:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.19}, URN = {urn:nbn:de:0030-drops-80391}, doi = {10.4230/LIPIcs.CALCO.2017.19}, annote = {Keywords: groupoids, networks, quantum, semantics, key distribution} }
David Reutter and Jamie Vicary. A 2-Categorical Approach to Composing Quantum Structures. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 20:1-20:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{reutter_et_al:LIPIcs.CALCO.2017.20, author = {Reutter, David and Vicary, Jamie}, title = {{A 2-Categorical Approach to Composing Quantum Structures}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {20:1--20:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.20}, URN = {urn:nbn:de:0030-drops-80389}, doi = {10.4230/LIPIcs.CALCO.2017.20}, annote = {Keywords: quantum constructions, 2-category, graphical calculus, planar algebra} }
Fatemeh Seifan, Lutz Schröder, and Dirk Pattinson. Uniform Interpolation in Coalgebraic Modal Logic. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{seifan_et_al:LIPIcs.CALCO.2017.21, author = {Seifan, Fatemeh and Schr\"{o}der, Lutz and Pattinson, Dirk}, title = {{Uniform Interpolation in Coalgebraic Modal Logic}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.21}, URN = {urn:nbn:de:0030-drops-80415}, doi = {10.4230/LIPIcs.CALCO.2017.21}, annote = {Keywords: modal logic, coalgebraic logic, uniform interpolation, preservation of weak pullbacks} }
Ana Sokolova and Harald Woracek. Termination in Convex Sets of Distributions. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{sokolova_et_al:LIPIcs.CALCO.2017.22, author = {Sokolova, Ana and Woracek, Harald}, title = {{Termination in Convex Sets of Distributions}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.22}, URN = {urn:nbn:de:0030-drops-80434}, doi = {10.4230/LIPIcs.CALCO.2017.22}, annote = {Keywords: convex algebra, one-point extensions, convex powerset monad} }
David Sprunger and Lawrence S. Moss. Precongruences and Parametrized Coinduction for Logics for Behavioral Equivalence. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{sprunger_et_al:LIPIcs.CALCO.2017.23, author = {Sprunger, David and Moss, Lawrence S.}, title = {{Precongruences and Parametrized Coinduction for Logics for Behavioral Equivalence}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {23:1--23:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.23}, URN = {urn:nbn:de:0030-drops-80474}, doi = {10.4230/LIPIcs.CALCO.2017.23}, annote = {Keywords: precongruence, kernel bisimulation, finitary functor, coalgebra, behavioural equivalence} }
Henning Urbat. Finite Behaviours and Finitary Corecursion. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 24:1-24:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{urbat:LIPIcs.CALCO.2017.24, author = {Urbat, Henning}, title = {{Finite Behaviours and Finitary Corecursion}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.24}, URN = {urn:nbn:de:0030-drops-80444}, doi = {10.4230/LIPIcs.CALCO.2017.24}, annote = {Keywords: Iterative algebra, completely iterative algebra, fg-iterative algebra, rational fixpoint, terminal coalgebra, iterative monad} }
Kenta Cho and Bart Jacobs. The EfProb Library for Probabilistic Calculations. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 25:1-25:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{cho_et_al:LIPIcs.CALCO.2017.25, author = {Cho, Kenta and Jacobs, Bart}, title = {{The EfProb Library for Probabilistic Calculations}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {25:1--25:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.25}, URN = {urn:nbn:de:0030-drops-80529}, doi = {10.4230/LIPIcs.CALCO.2017.25}, annote = {Keywords: probability, embedded language, effectus theory} }