Table of Contents

• Frontmatter, Table of Contents, Preface, Conference Organization [doi]
• Resource Lambda-Calculus: the Differential ViewpointThomas Ehrhard. 1 [doi]
• The Freedoms of Guarded BisimulationMartin Otto. 2 [doi]
• Branching vs. Linear Time: Semantical PerspectiveMoshe Y. Vardi. 3 [doi]
• Ontology-Based Data Access and Constraint SatisfactionFrank Wolter. 4 [doi]
• Power-Set Functors and Saturated TreesJirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa. 5-19 [doi]
• Transfinite Update Procedures for Predicative Systems of AnalysisFederico Aschieri. 20-34 [doi]
• A Non-Standard Semantics for Kahn Networks in Continuous TimeRomain Beauxis, Samuel Mimram. 35-50 [doi]
• Filter Models: Non-idempotent Intersection Types, Orthogonality and PolymorphismAlexis Bernadet, Stéphane Lengrand. 51-66 [doi]
• Algebraic Characterization of FO for Scattered Linear OrderingsAlexis Bès, Olivier Carton. 67-81 [doi]
• Determinizing Discounted-Sum AutomataUdi Boker, Thomas A. Henzinger. 82-96 [doi]
• Full Abstraction for Resource Calculus with TestsAntonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, Giulio Manzonetto. 97-111 [doi]
• Tight Upper Bounds for Streett and Parity ComplementationYang Cai, Ting Zhang. 112-128 [doi]
• A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description LogicsDomenico Cantone, Cristiano Longo, Marianna Nicolosi Asmundo. 129-143 [doi]
• Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of FormulasLuca Cardelli, Kim G. Larsen, Radu Mardare. 144-158 [doi]
• The Focused Calculus of StructuresKaustuv Chaudhuri, Nicolas Guenot, Lutz Straßburger. 159-173 [doi]
• A Semantic Approach to Illative Combinatory LogicLukasz Czajka. 174-188 [doi]
• Enumeration Complexity of Logical Query Problems with Second-order VariablesArnaud Durand, Yann Strozecki. 189-202 [doi]
• On Constraint Satisfaction Problems below PLászló Egri. 203-217 [doi]
• Non-Definability Results for Randomised First-Order LogicKord Eickmeyer. 218-232 [doi]
• System T and the Product of Selection FunctionsMartín Hötzel Escardó, Paulo Oliva, Thomas Powell 0001. 233-247 [doi]
• Unifying Büchi Complementation ConstructionsSeth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke. 248-263 [doi]
• Degrees of Lookahead in Context-free Infinite GamesWladimir Fridman, Christof Löding, Martin Zimmermann 0002. 264-276 [doi]
• L-Recursion and a new Logic for Logarithmic SpaceMartin Grohe, Berit Grußien, André Hernich, Bastian Laubner. 277-291 [doi]
• The Lax Braided Structure of Streaming I/OAlan Jeffrey, Julian Rathke. 292-306 [doi]
• The Church Synthesis Problem with MetricMark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell. 307-321 [doi]
• A Pumping Lemma for Collapsible Pushdown Graphs of Level 2Alexander Kartzow. 322-336 [doi]
• Decidability Issues for Two-Variable Logics with Several Linear OrdersEmanuel Kieronski. 337-351 [doi]
• Coalgebraic Derivations in Logic ProgrammingEkaterina Komendantskaya, John Power. 352-366 [doi]
• Trees in Trees: Is the Incomplete Information about a Tree Consistent?Eryk Kopczynski. 367-380 [doi]
• A Formal Theory for the Complexity Class Associated with the Stable Marriage ProblemDai Tri Man Le, Stephen A. Cook, Yuli Ye. 381-395 [doi]
• Relating Two Semantics of Locally Scoped NamesSteffen Lösch, Andrew M. Pitts. 396-411 [doi]
• Synthesis from Probabilistic ComponentsYoad Lustig, Sumit Nain, Moshe Y. Vardi. 412-427 [doi]
• Synthesizing Reactive ProgramsParthasarathy Madhusudan. 428-442 [doi]
• Concurrency Semantics for the Geiger-Paz-Pearl Axioms of IndependenceSara Miner More, Pavel Naumov, Benjamin Sapp. 443-457 [doi]
• Axiomatizing the QuoteAndrew Polonsky. 458-469 [doi]
• Relative Completeness for Logics of Functional ProgramsBernhard Reus, Thomas Streicher. 470-480 [doi]
• The Exact Hardness of Deciding Derivational and Runtime ComplexityAndreas Schnabl, Jakob Grue Simonsen. 481-495 [doi]
• A Category Theoretic View of Nondeterministic Recursive Program SchemesDaniel Schwencke. 496-511 [doi]
• Step-Indexed Relational Reasoning for Countable NondeterminismJan Schwinghammer, Lars Birkedal. 512-524 [doi]
• 2[<] on Finite WordsHoward Straubing. 525-537 [doi]
• Non-Commutative Infinitary Peano ArithmeticMakoto Tatsuta, Stefano Berardi. 538-552 [doi]
• Model Theory in Computer Science: My Own Recurrent ThemesJohann A. Makowsky. 553-567 [doi]