28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@Proceedings{fernandez_et_al:LIPIcs.CSL.2020, title = {{LIPIcs, Volume 152, CSL'20, Complete Volume}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020}, URN = {urn:nbn:de:0030-drops-117841}, doi = {10.4230/LIPIcs.CSL.2020}, annote = {Keywords: Theory of computation, Logic} }
28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fernandez_et_al:LIPIcs.CSL.2020.0, author = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.0}, URN = {urn:nbn:de:0030-drops-116431}, doi = {10.4230/LIPIcs.CSL.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Véronique Cortier. Verification of Security Protocols (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 1:1-1:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cortier:LIPIcs.CSL.2020.1, author = {Cortier, V\'{e}ronique}, title = {{Verification of Security Protocols}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {1:1--1:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.1}, URN = {urn:nbn:de:0030-drops-116447}, doi = {10.4230/LIPIcs.CSL.2020.1}, annote = {Keywords: Security protocols, automated deduction, security} }
Anuj Dawar. Symmetric Computation (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 2:1-2:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dawar:LIPIcs.CSL.2020.2, author = {Dawar, Anuj}, title = {{Symmetric Computation}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {2:1--2:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.2}, URN = {urn:nbn:de:0030-drops-116455}, doi = {10.4230/LIPIcs.CSL.2020.2}, annote = {Keywords: Descriptive Complexity, Fixed-point Logic with Counting, Circuit Complexity, Linear Programming, Hardness of Approximation, Arithmetic Circuits} }
Artur Jeż. Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 3:1-3:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jez:LIPIcs.CSL.2020.3, author = {Je\.{z}, Artur}, title = {{Solving Word Equations (And Other Unification Problems) by Recompression}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {3:1--3:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.3}, URN = {urn:nbn:de:0030-drops-116468}, doi = {10.4230/LIPIcs.CSL.2020.3}, annote = {Keywords: word equation, context unification, equations in groups, compression} }
Delia Kesner, Eduardo Bonelli, and Andrés Viso. Strong Bisimulation for Control Operators (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 4:1-4:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kesner_et_al:LIPIcs.CSL.2020.4, author = {Kesner, Delia and Bonelli, Eduardo and Viso, Andr\'{e}s}, title = {{Strong Bisimulation for Control Operators}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {4:1--4:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.4}, URN = {urn:nbn:de:0030-drops-116473}, doi = {10.4230/LIPIcs.CSL.2020.4}, annote = {Keywords: Lambda-mu calculus, proof-nets, strong bisimulation} }
Iddo Tzameret. From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 5:1-5:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{tzameret:LIPIcs.CSL.2020.5, author = {Tzameret, Iddo}, title = {{From Classical Proof Theory to P versus NP: a Guide to Bounded Theories}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {5:1--5:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.5}, URN = {urn:nbn:de:0030-drops-116482}, doi = {10.4230/LIPIcs.CSL.2020.5}, annote = {Keywords: Bounded arithmetic, complexity class separations, circuit complexity, proof complexity, weak theories of arithmetic, feasible mathematics} }
Matteo Acclavio and Roberto Maieli. Generalized Connectives for Multiplicative Linear Logic. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{acclavio_et_al:LIPIcs.CSL.2020.6, author = {Acclavio, Matteo and Maieli, Roberto}, title = {{Generalized Connectives for Multiplicative Linear Logic}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.6}, URN = {urn:nbn:de:0030-drops-116490}, doi = {10.4230/LIPIcs.CSL.2020.6}, annote = {Keywords: Linear Logic, Partitions Sets, Proof Nets, Sequent Calculus} }
Jiří Adámek. On Free Completely Iterative Algebras. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 7:1-7:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{adamek:LIPIcs.CSL.2020.7, author = {Ad\'{a}mek, Ji\v{r}{\'\i}}, title = {{On Free Completely Iterative Algebras}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {7:1--7:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.7}, URN = {urn:nbn:de:0030-drops-116503}, doi = {10.4230/LIPIcs.CSL.2020.7}, annote = {Keywords: free algebra, completely iterative algebra, terminal coalgebra, initial algebra, finitary functor} }
Dana Angluin, Timos Antonopoulos, and Dana Fisman. Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{angluin_et_al:LIPIcs.CSL.2020.8, author = {Angluin, Dana and Antonopoulos, Timos and Fisman, Dana}, title = {{Strongly Unambiguous B\"{u}chi Automata Are Polynomially Predictable With Membership Queries}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.8}, URN = {urn:nbn:de:0030-drops-116519}, doi = {10.4230/LIPIcs.CSL.2020.8}, annote = {Keywords: Polynomially predictable languages, Automata learning, Strongly unambiguous B\"{u}chi automata, Automata succinctness, Regular \omega-languages, Grammatical inference} }
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, and Filip Mazowiecki. A Robust Class of Linear Recurrence Sequences. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{barloy_et_al:LIPIcs.CSL.2020.9, author = {Barloy, Corentin and Fijalkow, Nathana\"{e}l and Lhote, Nathan and Mazowiecki, Filip}, title = {{A Robust Class of Linear Recurrence Sequences}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.9}, URN = {urn:nbn:de:0030-drops-116521}, doi = {10.4230/LIPIcs.CSL.2020.9}, annote = {Keywords: linear recurrence sequences, weighted automata, cost-register automata} }
Gili Bielous and Orna Kupferman. Coverage and Vacuity in Network Formation Games. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bielous_et_al:LIPIcs.CSL.2020.10, author = {Bielous, Gili and Kupferman, Orna}, title = {{Coverage and Vacuity in Network Formation Games}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {10:1--10:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.10}, URN = {urn:nbn:de:0030-drops-116532}, doi = {10.4230/LIPIcs.CSL.2020.10}, annote = {Keywords: Network Formation Games, Vacuity, Coverage} }
Paul Brunet. A Complete Axiomatisation of a Fragment of Language Algebra. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{brunet:LIPIcs.CSL.2020.11, author = {Brunet, Paul}, title = {{A Complete Axiomatisation of a Fragment of Language Algebra}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.11}, URN = {urn:nbn:de:0030-drops-116546}, doi = {10.4230/LIPIcs.CSL.2020.11}, annote = {Keywords: Kleene algebra, language algebra, completeness theorem, axiomatisation} }
Sam Buss, Anupam Das, and Alexander Knop. Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{buss_et_al:LIPIcs.CSL.2020.12, author = {Buss, Sam and Das, Anupam and Knop, Alexander}, title = {{Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.12}, URN = {urn:nbn:de:0030-drops-116553}, doi = {10.4230/LIPIcs.CSL.2020.12}, annote = {Keywords: proof complexity, decision trees, branching programs, logspace, sequent calculus, non-determinism, low-depth complexity} }
Evan Cavallo and Robert Harper. Internal Parametricity for Cubical Type Theory. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cavallo_et_al:LIPIcs.CSL.2020.13, author = {Cavallo, Evan and Harper, Robert}, title = {{Internal Parametricity for Cubical Type Theory}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {13:1--13:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.13}, URN = {urn:nbn:de:0030-drops-116564}, doi = {10.4230/LIPIcs.CSL.2020.13}, annote = {Keywords: parametricity, cubical type theory, higher inductive types} }
Evan Cavallo, Anders Mörtberg, and Andrew W Swan. Unifying Cubical Models of Univalent Type Theory. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cavallo_et_al:LIPIcs.CSL.2020.14, author = {Cavallo, Evan and M\"{o}rtberg, Anders and Swan, Andrew W}, title = {{Unifying Cubical Models of Univalent Type Theory}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.14}, URN = {urn:nbn:de:0030-drops-116578}, doi = {10.4230/LIPIcs.CSL.2020.14}, annote = {Keywords: Cubical Set Models, Cubical Type Theory, Homotopy Type Theory, Univalent Foundations} }
Yijia Chen and Jörg Flum. FO-Definability of Shrub-Depth. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chen_et_al:LIPIcs.CSL.2020.15, author = {Chen, Yijia and Flum, J\"{o}rg}, title = {{FO-Definability of Shrub-Depth}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.15}, URN = {urn:nbn:de:0030-drops-116587}, doi = {10.4230/LIPIcs.CSL.2020.15}, annote = {Keywords: shrub-depth, model-checking, monadic second-order logic} }
Jules Chouquet and Christine Tasson. Taylor expansion for Call-By-Push-Value. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 16:1-16:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chouquet_et_al:LIPIcs.CSL.2020.16, author = {Chouquet, Jules and Tasson, Christine}, title = {{Taylor expansion for Call-By-Push-Value}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {16:1--16:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.16}, URN = {urn:nbn:de:0030-drops-116594}, doi = {10.4230/LIPIcs.CSL.2020.16}, annote = {Keywords: Call-By-Push-Value, Quantitative semantics, Taylor expansion, Linear Logic} }
Robin Cockett, Jean-Simon Pacaud Lemay, and Rory B. B. Lucyshyn-Wright. Tangent Categories from the Coalgebras of Differential Categories. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 17:1-17:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cockett_et_al:LIPIcs.CSL.2020.17, author = {Cockett, Robin and Lemay, Jean-Simon Pacaud and Lucyshyn-Wright, Rory B. B.}, title = {{Tangent Categories from the Coalgebras of Differential Categories}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {17:1--17:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.17}, URN = {urn:nbn:de:0030-drops-116607}, doi = {10.4230/LIPIcs.CSL.2020.17}, annote = {Keywords: Differential categories, Tangent categories, Coalgebra Modalities} }
Robin Cockett, Geoffrey Cruttwell, Jonathan Gallagher, Jean-Simon Pacaud Lemay, Benjamin MacAdam, Gordon Plotkin, and Dorette Pronk. Reverse Derivative Categories. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cockett_et_al:LIPIcs.CSL.2020.18, author = {Cockett, Robin and Cruttwell, Geoffrey and Gallagher, Jonathan and Lemay, Jean-Simon Pacaud and MacAdam, Benjamin and Plotkin, Gordon and Pronk, Dorette}, title = {{Reverse Derivative Categories}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.18}, URN = {urn:nbn:de:0030-drops-116611}, doi = {10.4230/LIPIcs.CSL.2020.18}, annote = {Keywords: Reverse Derivatives, Cartesian Reverse Differential Categories, Categorical Semantics, Cartesian Differential Categories, Dagger Categories, Automatic Differentiation} }
Stéphane Demri, Etienne Lozes, and Alessio Mansutti. Internal Calculi for Separation Logics. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 19:1-19:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{demri_et_al:LIPIcs.CSL.2020.19, author = {Demri, St\'{e}phane and Lozes, Etienne and Mansutti, Alessio}, title = {{Internal Calculi for Separation Logics}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {19:1--19:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.19}, URN = {urn:nbn:de:0030-drops-116625}, doi = {10.4230/LIPIcs.CSL.2020.19}, annote = {Keywords: Separation logic, internal calculus, adjunct/quantifier elimination} }
Thomas Ferrère, Thomas A. Henzinger, and Bernhard Kragl. Monitoring Event Frequencies. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 20:1-20:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ferrere_et_al:LIPIcs.CSL.2020.20, author = {Ferr\`{e}re, Thomas and Henzinger, Thomas A. and Kragl, Bernhard}, title = {{Monitoring Event Frequencies}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {20:1--20:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.20}, URN = {urn:nbn:de:0030-drops-116633}, doi = {10.4230/LIPIcs.CSL.2020.20}, annote = {Keywords: monitoring, frequency property, Markov chain} }
Moses Ganardi and Bakhadyr Khoussainov. Automatic Equivalence Structures of Polynomial Growth. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ganardi_et_al:LIPIcs.CSL.2020.21, author = {Ganardi, Moses and Khoussainov, Bakhadyr}, title = {{Automatic Equivalence Structures of Polynomial Growth}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.21}, URN = {urn:nbn:de:0030-drops-116645}, doi = {10.4230/LIPIcs.CSL.2020.21}, annote = {Keywords: automatic structures, polynomial growth, isomorphism problem} }
Erich Grädel and Martin Otto. Guarded Teams: The Horizontally Guarded Case. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 22:1-22:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gradel_et_al:LIPIcs.CSL.2020.22, author = {Gr\"{a}del, Erich and Otto, Martin}, title = {{Guarded Teams: The Horizontally Guarded Case}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {22:1--22:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.22}, URN = {urn:nbn:de:0030-drops-116650}, doi = {10.4230/LIPIcs.CSL.2020.22}, annote = {Keywords: Team semantics, guarded logics, bisimulation, characterisation theorems} }
Julien Grange and Luc Segoufin. Order-Invariant First-Order Logic over Hollow Trees. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{grange_et_al:LIPIcs.CSL.2020.23, author = {Grange, Julien and Segoufin, Luc}, title = {{Order-Invariant First-Order Logic over Hollow Trees}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.23}, URN = {urn:nbn:de:0030-drops-116661}, doi = {10.4230/LIPIcs.CSL.2020.23}, annote = {Keywords: order-invariance, first-order logic} }
Giulio Guerrieri, Luc Pellissier, and Lorenzo Tortora de Falco. Glueability of Resource Proof-Structures: Inverting the Taylor Expansion. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 24:1-24:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{guerrieri_et_al:LIPIcs.CSL.2020.24, author = {Guerrieri, Giulio and Pellissier, Luc and Tortora de Falco, Lorenzo}, title = {{Glueability of Resource Proof-Structures: Inverting the Taylor Expansion}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {24:1--24:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.24}, URN = {urn:nbn:de:0030-drops-116674}, doi = {10.4230/LIPIcs.CSL.2020.24}, annote = {Keywords: linear logic, Taylor expansion, proof-net, natural transformation} }
Matthias Hoelzel and Richard Wilke. On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 25:1-25:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hoelzel_et_al:LIPIcs.CSL.2020.25, author = {Hoelzel, Matthias and Wilke, Richard}, title = {{On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {25:1--25:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.25}, URN = {urn:nbn:de:0030-drops-116681}, doi = {10.4230/LIPIcs.CSL.2020.25}, annote = {Keywords: Higher order logic, Existential second-order logic, Team semantics, Closure properties, Union closure, Model-checking games, Syntactic charactisations of semantical fragments} }
Clemens Kupke and Jurriaan Rot. Expressive Logics for Coinductive Predicates. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 26:1-26:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kupke_et_al:LIPIcs.CSL.2020.26, author = {Kupke, Clemens and Rot, Jurriaan}, title = {{Expressive Logics for Coinductive Predicates}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {26:1--26:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.26}, URN = {urn:nbn:de:0030-drops-116698}, doi = {10.4230/LIPIcs.CSL.2020.26}, annote = {Keywords: Coalgebra, Fibration, Modal Logic} }
Christof Löding and Andreas Tollkötter. State Space Reduction For Parity Automata. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{loding_et_al:LIPIcs.CSL.2020.27, author = {L\"{o}ding, Christof and Tollk\"{o}tter, Andreas}, title = {{State Space Reduction For Parity Automata}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.27}, URN = {urn:nbn:de:0030-drops-116701}, doi = {10.4230/LIPIcs.CSL.2020.27}, annote = {Keywords: automata, \omega-automata, parity, minimization, state space reduction, deterministic, simulation relations} }
Tim Lyon, Alwen Tiu, Rajeev Goré, and Ranald Clouston. Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{lyon_et_al:LIPIcs.CSL.2020.28, author = {Lyon, Tim and Tiu, Alwen and Gor\'{e}, Rajeev and Clouston, Ranald}, title = {{Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.28}, URN = {urn:nbn:de:0030-drops-116713}, doi = {10.4230/LIPIcs.CSL.2020.28}, annote = {Keywords: Bi-intuitionistic logic, Interpolation, Nested calculi, Proof theory, Sequents, Tense logics} }
Corto Mascle and Martin Zimmermann. The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{mascle_et_al:LIPIcs.CSL.2020.29, author = {Mascle, Corto and Zimmermann, Martin}, title = {{The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.29}, URN = {urn:nbn:de:0030-drops-116720}, doi = {10.4230/LIPIcs.CSL.2020.29}, annote = {Keywords: Hyperproperties, Linear Temporal Logic, Satisfiability} }
Étienne Miquey. Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability Models. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 30:1-30:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{miquey:LIPIcs.CSL.2020.30, author = {Miquey, \'{E}tienne}, title = {{Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability Models}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {30:1--30:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.30}, URN = {urn:nbn:de:0030-drops-116734}, doi = {10.4230/LIPIcs.CSL.2020.30}, annote = {Keywords: realizability, model theory, forcing, proofs-as-programs, \lambda-calculus, classical logic, duality, call-by-value, call-by-name, lattices, tripos} }
Joshua Moerman and Jurriaan Rot. Separation and Renaming in Nominal Sets. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 31:1-31:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{moerman_et_al:LIPIcs.CSL.2020.31, author = {Moerman, Joshua and Rot, Jurriaan}, title = {{Separation and Renaming in Nominal Sets}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {31:1--31:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.31}, URN = {urn:nbn:de:0030-drops-116744}, doi = {10.4230/LIPIcs.CSL.2020.31}, annote = {Keywords: Nominal sets, Separated product, Adjunction, Automata, Coalgebra} }
Paweł Parys. Parity Games: Another View on Lehtinen’s Algorithm. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{parys:LIPIcs.CSL.2020.32, author = {Parys, Pawe{\l}}, title = {{Parity Games: Another View on Lehtinen’s Algorithm}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {32:1--32:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.32}, URN = {urn:nbn:de:0030-drops-116757}, doi = {10.4230/LIPIcs.CSL.2020.32}, annote = {Keywords: Parity games, quasi-polynomial time, separating automata, good-for-games automata} }
Robert Passmann. De Jongh’s Theorem for Intuitionistic Zermelo-Fraenkel Set Theory. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 33:1-33:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{passmann:LIPIcs.CSL.2020.33, author = {Passmann, Robert}, title = {{De Jongh’s Theorem for Intuitionistic Zermelo-Fraenkel Set Theory}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.33}, URN = {urn:nbn:de:0030-drops-116767}, doi = {10.4230/LIPIcs.CSL.2020.33}, annote = {Keywords: Intuitionistic Logic, Intuitionistic Set Theory, Constructive Set Theory} }
Arno Pauly, Dongseong Seon, and Martin Ziegler. Computing Haar Measures. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{pauly_et_al:LIPIcs.CSL.2020.34, author = {Pauly, Arno and Seon, Dongseong and Ziegler, Martin}, title = {{Computing Haar Measures}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {34:1--34:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.34}, URN = {urn:nbn:de:0030-drops-116779}, doi = {10.4230/LIPIcs.CSL.2020.34}, annote = {Keywords: Computable analysis, topological groups, exact real arithmetic, Haar measure} }
José Espírito Santo. The Call-By-Value Lambda-Calculus with Generalized Applications. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 35:1-35:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{espiritosanto:LIPIcs.CSL.2020.35, author = {Esp{\'\i}rito Santo, Jos\'{e}}, title = {{The Call-By-Value Lambda-Calculus with Generalized Applications}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {35:1--35:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.35}, URN = {urn:nbn:de:0030-drops-116786}, doi = {10.4230/LIPIcs.CSL.2020.35}, annote = {Keywords: Generalized applications, Natural deduction, Strong normalization, Standardization, Call-by-name, Call-by-value, Protecting-by-a-lambda} }
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, and Ioannis Kokkinis. Dynamic Complexity Meets Parameterised Algorithms. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 36:1-36:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{schmidt_et_al:LIPIcs.CSL.2020.36, author = {Schmidt, Jonas and Schwentick, Thomas and Vortmeier, Nils and Zeume, Thomas and Kokkinis, Ioannis}, title = {{Dynamic Complexity Meets Parameterised Algorithms}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {36:1--36:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.36}, URN = {urn:nbn:de:0030-drops-116792}, doi = {10.4230/LIPIcs.CSL.2020.36}, annote = {Keywords: Dynamic complexity, parameterised complexity} }
Nils Vortmeier and Thomas Zeume. Dynamic Complexity of Parity Exists Queries. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 37:1-37:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{vortmeier_et_al:LIPIcs.CSL.2020.37, author = {Vortmeier, Nils and Zeume, Thomas}, title = {{Dynamic Complexity of Parity Exists Queries}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {37:1--37:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.37}, URN = {urn:nbn:de:0030-drops-116805}, doi = {10.4230/LIPIcs.CSL.2020.37}, annote = {Keywords: Dynamic complexity, parity quantifier, arity hierarchy} }
Feedback for Dagstuhl Publishing