Creative Commons
| Preface Zoltan Esik and R. Ramanujam | ||
| A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata |
||
| Klaus Aehlig | ||
| Relating two standard notions of secrecy | ||
| Véronique Cortier, Michaël Rusinowitch and Eugen Zălinescu | ||
| Algorithms for Omega-Regular Games with Imperfect Information | ||
| Jean-Francois Raskin, Krishnendu Chatterjee, Laurent Doyen and Thomas A. Henzinger | ||
| The Church Synthesis Problem with Parameters | ||
| Alexander Rabinovich | ||
| Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic | ||
| Vincent Atassi, Patrick Baillot and Kazushige Terui | ||
| Normalization of IZF with Replacement | ||
| Wojciech Moczydlowski | ||
| Semi-continuous Sized Types and Termination | ||
| Andreas Abel | ||
| Universal Structures and the logic of Forbidden Patterns | ||
| Florent R. Madelaine | ||