On this page:
Invited Speakers
- Thomas C. Hales
Some Methods of Problem Solving in Elementary Geometry - Martin Hyland
Categorical Combinatorics for Innocent Strategies - Phokion G. Kolaitis
Reflections on Finite Model Theory - Gordon D. Plotkin
The Algebraic Theory of Effects - Michael O. Rabin
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications - Colin Stirling
Higher-Order Matching, Games and Automata
Invited Papers
- Thomas C. Hales
Some Methods of Problem Solving in Elementary GeometryMore Information... - Russell Harmer Martin Hyland Paul-André Melliès
Categorical Combinatorics for Innocent StrategiesMore Information... - Phokion G. Kolaitis
Reflections on Finite Model TheoryMore Information... - Michael O. Rabin Rocco A. Servedio Christopher Thorpe
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and ApplicationsMore Information... - Colin Stirling
Higher-Order Matching, Games and AutomataMore Information...
Presented Papers
Entries are ordered by surname of first author
- Andreas Abel Thierry Coquand Peter Dybjer
Normalization by Evaluation for Martin-Löf Type Theory with Typed Equality JudgementsMore Information... - Rajeev Alur Marcelo Arenas Pablo Barceló Kousha Etessami Neil Immerman Leonid Libkin
First-Order and Temporal Logics for Nested WordsMore Information... - Patrick Baillot Paolo Coppola Ugo Dal Lago
Light Logics and Optimal Reduction: Completeness and ComplexityMore Information... - Manuel Bodirsky Hubie Chen
Quantified Equality ConstraintsMore Information... - Mikołaj Bojańczyk
Two-way unary temporal logic over treesMore Information... - Patricia Bouyer Nicolas Markey Joël Ouaknine James Worrell
The Cost of PunctualityMore Information... - Paul Brauner Clément Houtmann Claude Kirchner
Principles of SuperdeductionMore Information... - James Brotherston Alex K. Simpson
Complete Sequent Calculi for Induction and Infinite DescentMore Information... - Cristiano Calcagno Peter W. O'Hearn Hongseok Yang
Local Action and Abstract Separation LogicMore Information... - Mika Cohen Mads Dam
A Complete Axiomatization of Knowledge and CryptographyMore Information... - Anuj Dawar Martin Grohe Stephan Kreutzer
Locally Excluding a MinorMore Information... - Luca de Alfaro Rupak Majumdar Vishwanath Raman Mariëlle Stoelinga
Game Relations and MetricsMore Information... - Yuxin Deng Rob J. van Glabbeek Matthew Hennessy Carroll Morgan Chenyi Zhang
Characterising Testing Preorders for Finite Probabilistic ProcessesMore Information... - Abbas Edalat
A computable approach to measure and integration theoryMore Information... - László Egri Benoit Larose Pascal Tesson
Symmetric Datalog and Constraint Satisfaction Problems in LogspaceMore Information... - Martín H. Escardó
Infinite sets that admit fast exhaustive searchMore Information... - Hugo Gimbert Wieslaw Zielonka
Limits of Multi-Discounted Markov Decision ProcessesMore Information... - Jean Goubault-Larrecq
On Noetherian SpacesMore Information... - Pawel Idziak Petar Markovic Ralph McKenzie Matthew Valeriote Ross Willard
Tractability and learnability arising from algebras with few subpowersMore Information... - Marcin Jurdzinski Ranko Lazic
Alternation-free modal mu-calculus for data treesMore Information... - Detlef Kähler Ralf Küsters Tomasz Truderung
Infinite State AMC-Model Checking for Cryptographic ProtocolsMore Information... - Bartek Klin
Bialgebraic Operational Semantics and Modal LogicMore Information... - Salvatore La Torre Parthasarathy Madhusudan Gennaro Parlato
A Robust Class of Context-Sensitive LanguagesMore Information... - Paul-André Melliès Nicolas Tabareau
Resource modalities in game semanticsMore Information... - Wojciech Moczydlowski
A Dependent Set TheoryMore Information... - Rasmus E. Møgelberg Alex K. Simpson
Relational Parametricity for Computational EffectsMore Information... - Angelo Montanari Gabriele Puppis
A Contraction Method to Decide MSO Theories of Deterministic TreesMore Information... - Phuong Nguyen
Separating DAG-Like and Tree-Like Proof SystemsMore Information... - Phuong Nguyen Stephen A. Cook
The Complexity of Proving the Discrete Jordan Curve TheoremMore Information... - Paulo Oliva
Modified Realizability Interpretation of Classical Linear LogicMore Information... - Steven J. Perron
Examining The Fragments of GMore Information... - François Pottier
Static Name Control for FreshMLMore Information... - Francesco Ranzato Francesco Tapparo
A New Efficient Simulation Equivalence AlgorithmMore Information... - Colin Riba
Strong Normalization as Safe InteractionMore Information... - Davide Sangiorgi Naoki Kobayashi Eijiro Sumii
Environmental Bisimulations for Higher-Order LanguagesMore Information... - Ulrich Schöpp
Stratified Bounded Affine Logic for Logarithmic SpaceMore Information... - Balder ten Cate Johan van Benthem Jouko A. Väänänen
Lindström theorems for fragments of first-order logicMore Information... - Nikos Tzevelekos
Full abstraction for nominal general referencesMore Information...
Short Presentations
Entries are ordered by surname of first author
- Mikołaj Bojańczyk
The Common Fragment of CTL and LTL Needs Existential ModalitiesMore Information... - Andrzej S. Murawski
On the Effect of Bad VariablesMore Information... - Manas Patra
Descriptive Characterization of Quantum CircuitsMore Information... - Mauro Piccolo Claudia Faggian
Ludics, Game Semantics and ConcurrencyMore Information... - James Worthington
A Bisimulation-Based Proof System for the Equational Theory of Kleene AlgebraMore Information...
Organizers
General ChairMartín Abadi Program ChairLuke Ong Conference ChairJerzy Marcinkowski Publicity ChairStephan Kreutzer Nicole Schweikardt Workshops ChairPhilip J. Scott |
Program Committee:Albert Atserias (Technical University of California); Steve Awodey (Carnegie Mellon University); Nachum Dershowitz (Tel Aviv University); Thomas Ehrhard (University of Paris 7 and CNRS); Javier Esparza (University of Stuttgart); Marcelo P. Fiore (University of Cambridge); Erich Grädel (RWTH Aachen University); Thomas A. Henzinger (EPFL); Alan Jeffrey (Bell Labs); Achim Jung (University of Birmingham); Dexter C. Kozen (Cornell University); Kim G. Larsen (Aalborg University); Jerzy Marcinkowski (University of Wroclaw); Luke Ong (University of Oxford) (chair); Frank Pfenning (CMU); Andrew M. Pitts (Cambridge University); Vladimiro Sassone (University of Southampton); Nicole Schweikardt (Humboldt University Berlin); Peter Selinger (Dalhousie University); Natarajan Shankar (Computer Science Lab. SRI); Victor Vianu (University of California, San Diego); Igor Walukiewicz (CNRS, Bordeaux) Organizing CommitteeMartín Abadi; Samson Abramsky; Rajeev Alur; Franz Baader; Andrei Z. Broder; Samuel R. Buss; Edmund M. Clarke; Jürgen Giesl; Lauri Hella; Radha Jagadeesan; Alan Jeffrey; Phokion G. Kolaitis; Stephan Kreutzer; Richard E. Ladner; Johann A. Makowsky; Jerzy Marcinkowski; Mogens Nielsen; Luke Ong; Prakash Panangaden; Nicole Schweikardt; Philip J. Scott; Margus Veanes; Andrei Voronkov Advisory BoardRobert L. Constable; Yuri Gurevich; Thomas A. Henzinger; Claude Kirchner; Dexter C. Kozen; Ursula Martin; John C. Mitchell; Leszek Pacholski; Vaughan R. Pratt; Andre Scedrov; Dana S. Scott; Moshe Y. Vardi; Glynn Winskel |