Accepted papers
Daniel Leivant. Intrinsic theories for inductive and coinductive computing
Richard Statman. A new type assignment for strongly normalizable terms
Kentaro Kikuchi. Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus
Susumu Nishimura. A Full Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables
Pietro Galliani, Miika Hannula and Juha Kontinen. Hierarchies in independence logic
Stefan Göller. The Fixed-Parameter Tractability of Model Checking Concurrent Systems
Marcin Bilkowski and Michał Skrzypczak. Unambiguity and uniformization problems on infinite trees
Federico Aschieri, Stefano Berardi and Giovanni Birolo. Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1
Lionel Rieg. Extracting Herbrand trees in classical realizability using forcing
Christoph Berkholz, Andreas Krebs and Oleg Verbitsky. Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy
Johannes Schmidt and Michał Wrona. The Complexity of Abduction for Equality Constraint Languages
Pietro Galliani and Lauri Hella. Inclusion Logic and Fixed Point Logic
Thomas Colcombet, Denis Kuperberg, Christof Löding and Michael Vanden Boom. Deciding the weak definability of Büchi definable tree languages
Qian Wang and Bruno Barras. Semantics of Intensional Type Theory extended with Decidable Equational Theories
Bahareh Afshari and Graham E. Leigh. Closure ordinals for the modal mu-calculus
Paul Hunter. When is Metric Temporal Logic Expressively Complete?
Marek Materzok. Axiomatizing subtyped delimited continuations
Frederik Harwath and Nicole Schweikardt. On the locality of arb-invariant first-order logic with modulo counting quantifiers
Kaveh Ghasemloo and Stephen Cook. Theories for Subexponential-size Bounded-depth Frege Proofs
Christopher Broadbent and Naoki Kobayashi. Saturation-Based Model Checking of Higher-Order Recursion Schemes
Krishnendu Chatterjee and Nathanaël Fijalkow. Infinite-state games with finitary conditions
Ranald Clouston, Rajeev Goré and Alwen Tiu. Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic
Jérôme Fortier and Luigi Santocanale. Cuts for circular proofs: semantics and elimination
Christopher Hampson and Agi Kurucz. One-variable first-order linear temporal logics with counting
Paul-Andre Mellies. On dialogue games and coherent strategies
Amaldev Manuel and Thomas Zeume. Two-Variable Logic on 2-Dimensional Structures
Pierre Boudes, Fanny He and Michele Pagani. A characterization of the Taylor expansion of lambda-terms
Julian Bradfield. Team building in dependence
Pietro Di Gianantonio and Marina Lenisa. Innocent Game Semantics via Intersection Type Assignment Systems
Neelakantan Krishnaswami and Derek Dreyer. Internalizing Relational Parametricity in the Extensional Calculus of Constructions
Antti Kuusisto. Modal Logic and Distributed Message Passing Automata
Dexter Kozen and Konstantinos Mamouras. Typed Kleene Algebra with Products and Iteration Theories
Stéphane Gimenez and Georg Moser. The Structure of Interaction
Victor Dalmau, Andrei Bulatov and Marc Thurley. Descriptive complexity of approximate counting CSPs
Krishnendu Chatterjee, Martin Chmelík and Mathieu Tracol. What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives
Jakub Michaliszyn and Jan Otop. Elementary Modal Logics over Transitive Structures
Yoshihiro Maruyama. Categorical Duality Theory: Domains, Convexity, and the Distribution Monad