default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th CSL 2021: Ljubljana, Slovenia (Virtual Conference)
- Christel Baier
, Jean Goubault-Larrecq:
29th EACSL Annual Conference on Computer Science Logic, CSL 2021, Ljubljana, Slovenia (Virtual Conference), January 25-28, 2021. LIPIcs 183, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-175-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Bartek Klin:
μ-Calculi with Atoms (Invited Talk). 1:1-1:1 - Assia Mahboubi:
Mathematical Structures in Dependent Type Theory (Invited Talk). 2:1-2:3 - Sylvain Schmitz:
Branching in Well-Structured Transition Systems (Invited Talk). 3:1-3:3 - Linda Westrick:
Borel Sets in Reverse Mathematics (Invited Talk). 4:1-4:2 - Samson Abramsky, Rui Soares Barbosa:
The Logic of Contextuality. 5:1-5:18 - Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri:
Factorize Factorization. 6:1-6:25 - Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen:
The Best a Monitor Can Do. 7:1-7:23 - Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition? 8:1-8:17 - André Arnold, Damian Niwinski, Pawel Parys:
A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation. 9:1-9:23 - Steffen van Bergerem, Nicole Schweikardt:
Learning Concepts Described By Weight Aggregation Logic. 10:1-10:18 - Mark Bickford, Liron Cohen, Robert L. Constable, Vincent Rahli:
Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle. 11:1-11:23 - Udi Boker, Guy Hefetz:
Discounted-Sum Automata with Multiple Discount Factors. 12:1-12:23 - Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier:
Reachability in Distributed Memory Automata. 13:1-13:16 - Sabine Broda:
Pregrammars and Intersection Types. 14:1-14:22 - Thomas Colcombet, Daniela Petrisan, Riccardo Stabile:
Learning Automata and Transducers: A Categorical Approach. 15:1-15:17 - Adam Ó Conghaile, Anuj Dawar:
Game Comonads & Generalised Quantifiers. 16:1-16:17 - Katrin M. Dannert, Erich Grädel, Matthias Naaf, Val Tannen:
Semiring Provenance for Fixed-Point Logic. 17:1-17:22 - Anuj Dawar, Abhisekh Sankaran:
Extension Preservation in the Finite and Prefix Classes of First Order Logic. 18:1-18:13 - Bruno Dinis, Étienne Miquey:
Realizability with Stateful Computations for Nonstandard Analysis. 19:1-19:23 - Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment. 20:1-20:18 - Yannick Forster:
Church's Thesis and Related Axioms in Coq's Type Theory. 21:1-21:19 - Christine Gaßner, Arno Pauly, Florian Steinberg:
Computing Measure as a Primitive Operation in Real Number Computation. 22:1-22:22 - Guillaume Geoffroy, Paolo Pistone:
A Partial Metric Semantics of Higher-Order Types and Approximate Program Transformations. 23:1-23:18 - Giulio Guerrieri, Willem B. Heijltjes, Joseph W. N. Paulus:
A Deep Quantitative Type System. 24:1-24:24 - Giulio Guerrieri, Federico Olimpieri:
Categorifying Non-Idempotent Intersection Types. 25:1-25:24 - Merlin Göttlinger, Lutz Schröder, Dirk Pattinson:
The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies. 26:1-26:22 - Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. 27:1-27:22 - Tom de Jong, Martín Hötzel Escardó:
Domain Theory in Constructive and Predicative Univalent Foundations. 28:1-28:18 - Mayuko Kori, Takeshi Tsukada, Naoki Kobayashi:
A Cyclic Proof System for HFL_ℕ. 29:1-29:22 - Elena Di Lavore, Jules Hedges, Pawel Sobocinski:
Compositional Modelling of Network Games. 30:1-30:24 - Moritz Lichter, Pascal Schweitzer:
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. 31:1-31:18 - Aliaume Lopez:
Preservation Theorems Through the Lens of Topology. 32:1-32:17 - Benedikt Pago:
Choiceless Computation and Symmetry: Limitations of Definability. 33:1-33:21 - Long Pham, Jan Hoffmann:
Typable Fragments of Polynomial Automatic Amortized Resource Analysis. 34:1-34:19 - Paolo Pistone, Luca Tranchini:
The Yoneda Reduction of Polymorphic Types. 35:1-35:22 - Alexander Rabinovich, Doron Tiferet:
Degrees of Ambiguity for Parity Tree Automata. 36:1-36:20 - Philippe Schnoebelen:
On Flat Lossy Channel Machines. 37:1-37:22 - Haruka Tomita:
Realizability Without Symmetry. 38:1-38:16
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 2025-12-09 23:22 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:
