Abstract is missing.
- Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality JudgementsAndreas Abel, Thierry Coquand, Peter Dybjer. 3-12 [doi]
- Strong Normalization as Safe InteractionColin Riba. 13-22 [doi]
- A Dependent Set TheoryWojciech Moczydlowski. 23-34 [doi]
- Some Methods of Problem Solving in Elementary GeometryThomas C. Hales. 35-40 [doi]
- Principles of SuperdeductionPaul Brauner, Clément Houtmann, Claude Kirchner. 41-50 [doi]
- Complete Sequent Calculi for Induction and Infinite DescentJames Brotherston, Alex Simpson. 51-62 [doi]
- Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and ApplicationsMichael O. Rabin, Rocco A. Servedio, Christopher Thorpe. 63-76 [doi]
- A Complete Axiomatization of Knowledge and CryptographyMika Cohen, Mads Dam. 77-88 [doi]
- Limits of Multi-Discounted Markov Decision ProcessesHugo Gimbert, Wieslaw Zielonka. 89-98 [doi]
- Game Relations and MetricsLuca de Alfaro, Rupak Majumdar, Vishwanath Raman, Mariëlle Stoelinga. 99-108 [doi]
- The Cost of PunctualityPatricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell. 109-120 [doi]
- Two-way unary temporal logic over treesMikolaj Bojanczyk. 121-130 [doi]
- Alternation-free modal mu-calculus for data treesMarcin Jurdzinski, Ranko Lazic. 131-140 [doi]
- A Contraction Method to Decide MSO Theories of Deterministic TreesAngelo Montanari, Gabriele Puppis. 141-150 [doi]
- First-Order and Temporal Logics for Nested WordsRajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin. 151-160 [doi]
- A Robust Class of Context-Sensitive LanguagesSalvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato. 161-170 [doi]
- A New Efficient Simulation Equivalence AlgorithmFrancesco Ranzato, Francesco Tapparo. 171-180 [doi]
- Infinite State AMC-Model Checking for Cryptographic ProtocolsDetlef Kähler, Ralf Küsters, Tomasz Truderung. 181-192 [doi]
- Symmetric Datalog and Constraint Satisfaction Problems in LogspaceLászló Egri, Benoit Larose, Pascal Tesson. 193-202 [doi]
- Quantified Equality ConstraintsManuel Bodirsky, Hubie Chen. 203-212 [doi]
- Tractability and learnability arising from algebras with few subpowersPawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard. 213-224 [doi]
- Examining The Fragments of GSteven James Perron. 225-234 [doi]
- Separating DAG-Like and Tree-Like Proof SystemsPhuong Nguyen. 235-244 [doi]
- The Complexity of Proving the Discrete Jordan Curve TheoremPhuong Nguyen, Stephen A. Cook. 245-256 [doi]
- Reflections on Finite Model TheoryPhokion G. Kolaitis. 257-269 [doi]
- Locally Excluding a MinorAnuj Dawar, Martin Grohe, Stephan Kreutzer. 270-279 [doi]
- Lindstrom theorems for fragments of first-order logicBalder ten Cate, Johan van Benthem, Jouko A. Väänänen. 280-292 [doi]
- Environmental Bisimulations for Higher-Order LanguagesDavide Sangiorgi, Naoki Kobayashi, Eijiro Sumii. 293-302 [doi]
- Pi-Calculus in Logical FormMarcello M. Bonsangue, Alexander Kurz. 303-312 [doi]
- Characterising Testing Preorders for Finite Probabilistic ProcessesYuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang. 313-325 [doi]
- Higher-Order Matching, Games and AutomataColin Stirling. 326-335 [doi]
- Bialgebraic Operational Semantics and Modal LogicBartek Klin. 336-345 [doi]
- Relational Parametricity for Computational EffectsRasmus Ejlers Møgelberg, Alex Simpson. 346-355 [doi]
- Static Name Control for FreshMLFrançois Pottier. 356-365 [doi]
- Local Action and Abstract Separation LogicCristiano Calcagno, Peter W. O Hearn, Hongseok Yang. 366-378 [doi]
- Categorical Combinatorics for Innocent StrategiesRussell Harmer, Martin Hyland, Paul-André Melliès. 379-388 [doi]
- Resource modalities in game semanticsPaul-André Melliès, Nicolas Tabareau. 389-398 [doi]
- Full abstraction for nominal general referencesNikos Tzevelekos. 399-410 [doi]
- Stratified Bounded Affine Logic for Logarithmic SpaceUlrich Schöpp. 411-420 [doi]
- Light Logics and Optimal Reduction: Completeness and ComplexityPatrick Baillot, Paolo Coppola, Ugo Dal Lago. 421-430 [doi]
- Modified Realizability Interpretation of Classical Linear LogicPaulo Oliva. 431-442 [doi]
- Infinite sets that admit fast exhaustive searchMartín Hötzel Escardó. 443-452 [doi]
- On Noetherian SpacesJean Goubault-Larrecq. 453-462 [doi]
- A computable approach to measure and integration theoryAbbas Edalat. 463-472 [doi]