Creative Commons
| Preface Erich Grädel, C.-H. Luke Ong and Andrew M. Pitts | ||
| Exhaustible sets in higher-type computation | ||
| Martin Escardo | ||
| Game Refinement Relations and Metrics | ||
| Luca de Alfaro, Rupak Majumdar, Vishwanath Raman and Mariëlle Stoelinga | ||
| Characterising Testing Preorders for Finite Probabilistic Processes | ||
| Yuxin Deng, Robert J. van Glabbeek, Matthew Hennessy and Carroll C. Morgan | ||
| First-Order and Temporal Logics for Nested Words | ||
| Rajeev Alur, Marcelo Arenas, Pablo Barcelo, Kousha Etessami, Neil Immerman and Leonid Libkin | ||
| Two-Way Unary Temporal Logic over Trees | ||
| Mikołaj Bojańczyk | ||
| Full abstraction for nominal general references | ||
| Nikos Tzevelekos | ||