List of Accepted Papers

Klaus Aehlig and Arnold Beckmann. On the computational complexity of cut-reduction
Christian Urban, James Cheney and Stefan Berghofer. Mechanising the Metatheory of LF
Matthew Hague, Andrzej Murawski, Luke Ong and Olivier Serre. Collapsible Pushdown Automata and Recursion Schemes
Francois Pottier. Hiding local state in direct style: a higher-order anti-frame rule
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye and Marcus Groesser. Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
Taolue Chen and Wan Fokkink. On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
Ivan Lanese, Jorge A. Perez, Davide Sangiorgi and Alan Schmitt. On  the  Expressiveness and Decidability of Higher-Order Process Calculi
Mikolaj Bojanczyk, Luc Segoufin and Howard Straubing. Piecewise testable tree languages
Barnaby Martin, Florent Madelaine and Hubie Chen. Quantified Constraints and Containment Problems
Marc de Falco. The Geometry of Interaction of Differential Interaction Nets
Soren B. Lassen and Paul Blain Levy. Typed Normal Form Bisimulation for Parametric Polymorphism
Arnaud Carayol, Matthew Hague, Antoine Meyer, Luke Ong and Olivier Serre. Winning regions of higher-order pushdown games
James F. Lynch. A Logical Characterization of Individual-Based Models
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb\'an and Andre Nies. From Automatic Structures to Borel Structures
David Duris. Hypergraph acyclicity and extension preservation theorems
Pierre Chambart and Philippe Schnoebelen. The Ordinal Recursive Complexity of Lossy Channel Systems
Soren Riis. On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity
Vineet Kahlon. Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs
Roberto Maieli and Olivier Laurent. Local Cut Elimination for Monomial MALL Proof Nets
Adrià Gascón, Guillem Godoy and Manfred Schmidt-Schauss. Context  Matching for  Compressed Terms
Andrzej Murawski. Reachability games and game semantics: on comparing nondeterministic programs
Emmanuel Beffara. An algebraic process calculus
Makoto Tatsuta. Types for Hereditary Permutators
Martin Grohe. Definable tree decompositions
Catarina Carvalho, Victor Dalmau and Andrei Krokhin. Caterpillar duality for constraint satisfaction problems
Olivier Delande and Dale Miller. A neutral approach to proof and refutation in MALL
Virgile Mogbil and Paulin Jacobé de Naurois. Correctness of Multiplicative Additive Proof Structures is NL-Complete
Guillaume Burel. A First-Order Representation of Pure Type Systems using Superdeduction
Tomas Brazdil, Jan Kretinsky, Antonin Kucera and Vojtech Forejt. The Satisfiability Problem for Probabilistic CTL
Abbas Edalat. Weak topology and differentiable operator for Lipschitz maps
Gordon Plotkin and Matija Pretnar. A Logic for Algebraic Effects
Agata Ciabattoni, Nikolaos Galatos and Kazushige Terui. From axioms to analytic rules in nonclassical logics
Rohit Chadha, A. Prasad Sistla and Mahesh Viswanathan. On the Expressiveness and Complexity of Randomization in Finite State Monitors
Victor Dalmau and Benoit Larose. Maltsev + Datalog -> Symmetric Datalog
Carsten Schürmann and Jeffrey Sarnat. Structural Logical Relations
Andrew Gacek, Dale Miller and Gopalan Nadathur. Combining generic judgments with recursive definitions
Marcelo Fiore. Second-Order and Dependently-Sorted Abstract Syntax
Daniel R Licata, Noam Zeilberger and Robert Harper. Focusing on Binding and Computation