Accepted Papers

Patrick Baillot, Marco Pedicini
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus

Marion Jean-Yves, Pechoux Romain
Quasi-friendly sup-interpretations

Johann A. Makowsky
Logical and Computational Aspects of Graph Polynomials: A Survey

Antonina Kolokolova, Yongmei Liu, David Mitchell, and Eugenia Ternovska
Complexity of Expanding a Finite Structure and Related Tasks

Patrick Baillot, Ugo Dal Lago, and Jean-Yves Moyen
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity

Yevgeniy Makarov
Comparing efficiency of functions provable in classical and constructive logics

Murray Patterson, Yongmei Liu, Eugenia Ternovska, and Arvind Gupta
Grounding for Model Expansion in $k$-Guarded Formulas