default search action
10th CALCO 2023: Bloomington, IN, USA
- Paolo Baldan
, Valeria de Paiva
10th Conference on Algebra and Coalgebra in Computer Science, CALCO 2023, June 19-21, 2023, Indiana University Bloomington, IN, USA. LIPIcs 270, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-287-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Robert Harper:
Integrating Cost and Behavior in Type Theory (Invited Talk). 1:1-1:2 - Roberto Bruni:
Local Completeness for Program Correctness and Incorrectness (Invited Talk). 2:1-2:2 - Elaine Pimentel
A Tour on Ecumenical Systems (Invited Talk). 3:1-3:15 - Jeremy G. Siek:
The Metatheory of Gradual Typing: State of the Art and Challenges (Invited Talk). 4:1-4:1 - Assia Mahboubi:
Machine-Checked Computational Mathematics (Invited Talk). 5:1-5:1 - Ruben Turkenburg, Harsh Beohar, Clemens Kupke, Jurriaan Rot:
Forward and Backward Steps in a Fibration. 6:1-6:18 - Harald König, Uwe Wolter, Tim Kräuter
Structural Operational Semantics for Heterogeneously Typed Coalgebras. 7:1-7:17 - Andrzej Tarlecki
Interpolation Is (Not Always) Easy to Spoil. 8:1-8:19 - Aleksandar Milosavljevic, Robin Piedeleu, Fabio Zanasi
String Diagram Rewriting Modulo Commutative (Co)Monoid Structure. 9:1-9:17 - Jirí Adámek, Matej Dostál, Jirí Velebil:
Strongly Finitary Monads for Varieties of Quantitative Algebras. 10:1-10:14 - Stefan Zetzsche, Alexandra Silva, Matteo Sammartino:
Generators and Bases for Monadic Closures. 11:1-11:19 - Jurriaan Rot, Thorsten Wißmann:
Bisimilar States in Uncertain Structures. 12:1-12:17 - Dario Stein, Richard Samuelson
A Category for Unifying Gaussian Probability and Nondeterminism. 13:1-13:18 - Todd Schmid
Fractals from Regular Behaviours. 14:1-14:18 - Paige Randall North, Maximilien Péroux
Coinductive Control of Inductive Data Types. 15:1-15:17 - Tobias Fritz, Fabio Gadducci, Paolo Perrone, Davide Trotta:
Weakly Markov Categories and Weakly Affine Monads. 16:1-16:17 - Alexander Kurz
Many-Valued Coalgebraic Logic: From Boolean Algebras to Primal Varieties. 17:1-17:17 - Henning Basold, Tanjona Ralaivaosaona:
Composition and Recursion for Causal Structures. 18:1-18:17 - Jérémy Dubut:
Aczel-Mendler Bisimulations in a Regular Category. 19:1-19:18 - Guido Boccali, Andrea Laretto, Fosco Loregiàn, Stefano Luneia:
Completeness for Categories of Generalized Automata ((Co)algebraic pearls). 20:1-20:14 - Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls). 21:1-21:20 - Nathan Liittschwager, Stelios Tsampas, Jonathan Castello, Lindsey Kuper:
CRDTs, Coalgebraically (Early Ideas). 22:1-22:5 - Harrison Grodin
Amortized Analysis via Coinduction (Early Ideas). 23:1-23:6 - Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Higher-Order Mathematical Operational Semantics (Early Ideas). 24:1-24:3
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-12-15 01:16 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: