default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSL 2018: Birmingham, UK
- Dan R. Ghica, Achim Jung:
27th EACSL Annual Conference on Computer Science Logic, CSL 2018, September 4-7, 2018, Birmingham, UK. LIPIcs 119, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-088-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xiv
- Dexter Kozen, Thomas Schwentick:
The Ackermann Award 2018. 1:1-1:5 - Samson Abramsky
, Nihil Shah:
Relating Structure and Power: Comonadic Semantics for Computational Resources. 2:1-2:17 - Faried Abu Zaid, Dietrich Kuske, Peter Lindner:
Climbing up the Elementary Complexity Classes with Theories of Automatic Structures. 3:1-3:16 - Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi:
High-Level Signatures and Initial Semantics. 4:1-4:22 - Aurore Alcolei, Pierre Clairambault, Martin Hyland, Glynn Winskel:
The True Concurrency of Herbrand's Theorem. 5:1-5:22 - Carlo Angiuli, Kuen-Bang Hou (Favonia), Robert Harper:
Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities. 6:1-6:17 - Albert Atserias, Anuj Dawar:
Definable Inapproximability: New Challenges for Duplicator. 7:1-7:21 - Arnon Avron, Shahar Lev, Nissan Levi:
Safety, Absoluteness, and Computability. 8:1-8:17 - Patrick Baillot, Alexis Ghyselen:
Combining Linear Logic and Size Types for Implicit Complexity. 9:1-9:21 - Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond Admissibility: Dominance Between Chains of Strategies. 10:1-10:22 - Nicolas Behr, Pawel Sobocinski:
Rule Algebras for Adhesive Categories. 11:1-11:21 - Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. 12:1-12:22 - Filippo Bonchi, Jens Seeber, Pawel Sobocinski:
Graphical Conjunctive Queries. 13:1-13:23 - Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Approximating Probabilistic Automata by Regular Languages. 14:1-14:23 - Jules Chouquet, Lionel Vaux Auclair:
An Application of Parallel Cut Elimination in Unit-Free Multiplicative Linear Logic to the Taylor Expansion of Proof Nets. 15:1-15:17 - Pierre Clairambault, Hugo Paquet:
Fully Abstract Models of the Probabilistic lambda-calculus. 16:1-16:17 - Liron Cohen, Reuben N. S. Rowe:
Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent. 17:1-17:16 - Anupam Das, Isabel Oitavem:
A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. 18:1-18:17 - Anupam Das, Damien Pous:
Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). 19:1-19:18 - Anuj Dawar, Gregory Wilsenach:
Symmetric Circuits for Rank Logic. 20:1-20:16 - Paul Downen, Zena M. Ariola:
Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing. 21:1-21:23 - Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema:
Expressivity Within Second-Order Transitive-Closure Logic. 22:1-22:18 - Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin:
Quantifying Bounds in Strategy Logic. 23:1-23:23 - William John Gowers, James David Laird:
A Fully Abstract Game Semantics for Countable Nondeterminism. 24:1-24:18 - Erich Grädel, Matthias Hoelzel:
Dependency Concepts up to Equivalence. 25:1-25:21 - Béatrice Bérard, Patricia Bouyer, Vincent Jugé:
Finite Bisimulations for Dynamical Systems with Overlapping Trajectories. 26:1-26:17 - Toru Kawata:
A Contextual Reconstruction of Monadic Reflection. 27:1-27:14 - Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation. 28:1-28:17 - Aliaume Lopez, Alex Simpson:
Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular. 29:1-29:17 - Martin Lück:
Canonical Models and the Complexity of Modal Team Logic. 30:1-30:23 - P. Madhusudan, Umang Mathur, Shambwaditya Saha, Mahesh Viswanathan:
A Decidable Fragment of Second Order Logic With Applications to Synthesis. 31:1-31:19 - Dan Marsden, Maaike Zwart:
Quantitative Foundations for Resource Theories. 32:1-32:17 - Guy McCusker, Alessio Santamaria:
On Compositionality of Dinatural Transformations. 33:1-33:22 - Daniel Neider, Alexander Weinert, Martin Zimmermann:
Synthesizing Optimally Resilient Controllers. 34:1-34:17 - Rémi Nollet, Alexis Saurin, Christine Tasson:
Local Validity for Circular Proofs in Linear Logic with Fixed Points. 35:1-35:23 - Sven Schewe, Alexander Weinert, Martin Zimmermann:
Parity Games with Weights. 36:1-36:17 - Kazushige Terui:
MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics. 37:1-37:19
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-27 21:12 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:
