LIPIcs, Volume 183, CSL 2021
-
Christel Baier and Jean Goubault-Larrecq
LIPIcs, Volume 183, CSL 2021, Complete Volume
10.4230/LIPIcs.CSL.2021
-
Christel Baier and Jean Goubault-Larrecq
Front Matter, Table of Contents, Preface, Conference Organization
10.4230/LIPIcs.CSL.2021.0
-
Bartek Klin
μ-Calculi with Atoms (Invited Talk)
10.4230/LIPIcs.CSL.2021.1
-
Assia Mahboubi
Mathematical Structures in Dependent Type Theory (Invited Talk)
10.4230/LIPIcs.CSL.2021.2
-
Sylvain Schmitz
Branching in Well-Structured Transition Systems (Invited Talk)
10.4230/LIPIcs.CSL.2021.3
-
Linda Westrick
Borel Sets in Reverse Mathematics (Invited Talk)
10.4230/LIPIcs.CSL.2021.4
-
Samson Abramsky and Rui Soares Barbosa
The Logic of Contextuality
10.4230/LIPIcs.CSL.2021.5
-
Beniamino Accattoli, Claudia Faggian, and Giulio Guerrieri
Factorize Factorization
10.4230/LIPIcs.CSL.2021.6
-
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen
The Best a Monitor Can Do
10.4230/LIPIcs.CSL.2021.7
-
Luca Aceto, Valentina Castiglioni, Wan Fokkink, Anna Ingólfsdóttir, and Bas Luttik
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?
10.4230/LIPIcs.CSL.2021.8
-
André Arnold, Damian Niwiński, and Paweł Parys
A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation
10.4230/LIPIcs.CSL.2021.9
-
Steffen van Bergerem and Nicole Schweikardt
Learning Concepts Described By Weight Aggregation Logic
10.4230/LIPIcs.CSL.2021.10
-
Mark Bickford, Liron Cohen, Robert L. Constable, and Vincent Rahli
Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle
10.4230/LIPIcs.CSL.2021.11
-
Udi Boker and Guy Hefetz
Discounted-Sum Automata with Multiple Discount Factors
10.4230/LIPIcs.CSL.2021.12
-
Benedikt Bollig, Fedor Ryabinin, and Arnaud Sangnier
Reachability in Distributed Memory Automata
10.4230/LIPIcs.CSL.2021.13
-
Sabine Broda
Pregrammars and Intersection Types
10.4230/LIPIcs.CSL.2021.14
-
Thomas Colcombet, Daniela Petrişan, and Riccardo Stabile
Learning Automata and Transducers: A Categorical Approach
10.4230/LIPIcs.CSL.2021.15
-
Adam Ó Conghaile and Anuj Dawar
Game Comonads & Generalised Quantifiers
10.4230/LIPIcs.CSL.2021.16
-
Katrin M. Dannert, Erich Grädel, Matthias Naaf, and Val Tannen
Semiring Provenance for Fixed-Point Logic
10.4230/LIPIcs.CSL.2021.17
-
Anuj Dawar and Abhisekh Sankaran
Extension Preservation in the Finite and Prefix Classes of First Order Logic
10.4230/LIPIcs.CSL.2021.18
-
Bruno Dinis and Étienne Miquey
Realizability with Stateful Computations for Nonstandard Analysis
10.4230/LIPIcs.CSL.2021.19
-
Mnacho Echenim, Radu Iosif, and Nicolas Peltier
Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment
10.4230/LIPIcs.CSL.2021.20
-
Yannick Forster
Church’s Thesis and Related Axioms in Coq’s Type Theory
10.4230/LIPIcs.CSL.2021.21
-
Christine Gaßner, Arno Pauly, and Florian Steinberg
Computing Measure as a Primitive Operation in Real Number Computation
10.4230/LIPIcs.CSL.2021.22
-
Guillaume Geoffroy and Paolo Pistone
A Partial Metric Semantics of Higher-Order Types and Approximate Program Transformations
10.4230/LIPIcs.CSL.2021.23
-
Giulio Guerrieri, Willem B. Heijltjes, and Joseph W.N. Paulus
A Deep Quantitative Type System
10.4230/LIPIcs.CSL.2021.24
-
Giulio Guerrieri and Federico Olimpieri
Categorifying Non-Idempotent Intersection Types
10.4230/LIPIcs.CSL.2021.25
-
Merlin Göttlinger, Lutz Schröder, and Dirk Pattinson
The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies
10.4230/LIPIcs.CSL.2021.26
-
Miika Hannula, Juha Kontinen, Martin Lück, and Jonni Virtema
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic
10.4230/LIPIcs.CSL.2021.27
-
Tom de Jong and Martín Hötzel Escardó
Domain Theory in Constructive and Predicative Univalent Foundations
10.4230/LIPIcs.CSL.2021.28
-
Mayuko Kori, Takeshi Tsukada, and Naoki Kobayashi
A Cyclic Proof System for HFL_ℕ
10.4230/LIPIcs.CSL.2021.29
-
Elena Di Lavore, Jules Hedges, and Paweł Sobociński
Compositional Modelling of Network Games
10.4230/LIPIcs.CSL.2021.30
-
Moritz Lichter and Pascal Schweitzer
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time
10.4230/LIPIcs.CSL.2021.31
-
Aliaume Lopez
Preservation Theorems Through the Lens of Topology
10.4230/LIPIcs.CSL.2021.32
-
Benedikt Pago
Choiceless Computation and Symmetry: Limitations of Definability
10.4230/LIPIcs.CSL.2021.33
-
Long Pham and Jan Hoffmann
Typable Fragments of Polynomial Automatic Amortized Resource Analysis
10.4230/LIPIcs.CSL.2021.34
-
Paolo Pistone and Luca Tranchini
The Yoneda Reduction of Polymorphic Types
10.4230/LIPIcs.CSL.2021.35
-
Alexander Rabinovich and Doron Tiferet
Degrees of Ambiguity for Parity Tree Automata
10.4230/LIPIcs.CSL.2021.36
-
Philippe Schnoebelen
On Flat Lossy Channel Machines
10.4230/LIPIcs.CSL.2021.37
-
Haruka Tomita
Realizability Without Symmetry
10.4230/LIPIcs.CSL.2021.38