default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th CALCO 2021: Salzburg, Austria
- Fabio Gadducci
, Alexandra Silva:
9th Conference on Algebra and Coalgebra in Computer Science, CALCO 2021, August 31 to September 3, 2021, Salzburg, Austria. LIPIcs 211, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-212-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Eugenia Cheng:
Distributive Laws for Lawvere Theories (Invited Talk). 1:1-1:1 - Holger Giese:
Towards Engineering Smart Cyber-Physical Systems with Graph Transformation Systems (Invited Talk). 2:1-2:1 - Valeria de Paiva:
Dialectica Comonads (Invited Talk). 3:1-3:13 - Viktor Vafeiadis:
The Challenges of Weak Persistency (Invited Talk). 4:1-4:3 - Jirí Adámek, Stefan Milius, Lawrence S. Moss:
Initial Algebras Without Iteration ((Co)algebraic pearls). 5:1-5:20 - Jirí Adámek, Jirí Rosický:
Which Categories Are Varieties? ((Co)algebraic pearls). 6:1-6:14 - Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Tensor of Quantitative Equational Theories. 7:1-7:17 - Jos C. M. Baeten, Cesare Carissimo, Bas Luttik:
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. 8:1-8:16 - Filippo Bonchi, Alessandro Di Giorgio, Fabio Zanasi:
From Farkas' Lemma to Linear Programming: an Exercise in Diagrammatic Algebra ((Co)algebraic pearls). 9:1-9:19 - Filippo Bonchi, Alessio Santamaria, Jens Seeber, Pawel Sobocinski:
On Doctrines and Cartesian Bicategories. 10:1-10:17 - Filippo Bonchi, Ana Sokolova, Valeria Vignudelli:
Presenting Convex Sets of Probability Distributions by Convex Semilattices and Unique Bases ((Co)algebraic pearls). 11:1-11:18 - Davide Castelnovo, Marino Miculan:
Closure Hyperdoctrines. 12:1-12:21 - Fredrik Dahlqvist, Todd Schmid:
How to Write a Coequation ((Co)algebraic pearls). 13:1-13:25 - Chase Ford, Stefan Milius, Lutz Schröder:
Monads on Categories of Relational Structures. 14:1-14:17 - Richard Garner:
Stream Processors and Comodels. 15:1-15:17 - Clemens Grabmayer:
A Coinductive Version of Milner's Proof System for Regular Expressions Modulo Bisimilarity. 16:1-16:23 - Tao Gu, Fabio Zanasi:
Functorial Semantics as a Unifying Perspective on Logic Programming. 17:1-17:22 - Xiaodong Jia, Michael W. Mislove, Vladimir Zamdzhiev:
The Central Valuations Monad (Early Ideas). 18:1-18:5 - Jean-Simon Pacaud Lemay:
Coderelictions for Free Exponential Modalities. 19:1-19:21 - Jade Master:
The Open Algebraic Path Problem. 20:1-20:20 - Koko Muroya, Takahiro Sanada, Natsuki Urabe:
Preorder-Constrained Simulation for Nondeterministic Automata (Early Ideas). 21:1-21:5 - Georgi Nakov, Fredrik Nordvall Forsberg:
Quantitative Polynomial Functors (Early Ideas). 22:1-22:5 - Ana Sokolova, Harald Woracek:
Nawrotzki's Algorithm for the Countable Splitting Lemma, Constructively ((Co)algebraic pearls). 23:1-23:16 - Thorsten Wißmann:
Minimality Notions via Factorization Systems ((Co)algebraic pearls). 24:1-24:21
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.
last updated on 2024-10-31 20:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
