Abstract is missing.
- On the Expressiveness and Complexity of Randomization in Finite State MonitorsRohit Chadha, A. Prasad Sistla, Mahesh Viswanathan. 18-29 [doi]
- Combining Generic Judgments with Recursive DefinitionsAndrew Gacek, Dale Miller, Gopalan Nadathur. 33-44 [doi]
- Mechanizing the Metatheory of LFChristian Urban, James Cheney, Stefan Berghofer. 45-56 [doi]
- Second-Order and Dependently-Sorted Abstract SyntaxMarcelo P. Fiore. 57-68 [doi]
- Structural Logical RelationsCarsten Schürmann, Jeffrey Sarnat. 69-80 [doi]
- Types for Hereditary PermutatorsMakoto Tatsuta. 83-92 [doi]
- Context Matching for Compressed TermsAdria Gascón, Guillem Godoy, Manfred Schmidt-Schauß. 93-102 [doi]
- Nonlocal Flow of Control and Kleene Algebra with TestsDexter Kozen. 105-117 [doi]
- A Logic for Algebraic EffectsGordon D. Plotkin, Matija Pretnar. 118-129 [doi]
- An Algebraic Process CalculusEmmanuel Beffara. 130-141 [doi]
- On the Expressiveness and Decidability of Higher-Order Process CalculiIvan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt. 145-155 [doi]
- On the Axiomatizability of Impossible Futures: Preorder versus EquivalenceTaolue Chen, Wan Fokkink. 156-165 [doi]
- General Structural Operational Semantics through Categorical LogicSam Staton. 166-177 [doi]
- Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent ProgramsVineet Kahlon. 181-192 [doi]
- Winning Regions of Higher-Order Pushdown GamesArnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre. 193-204 [doi]
- The Ordinal Recursive Complexity of Lossy Channel SystemsPierre Chambart, Ph. Schnoebelen. 205-216 [doi]
- Almost-Sure Model Checking of Infinite Paths in One-Clock Timed AutomataChristel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer. 217-226 [doi]
- From Axioms to Analytic Rules in Nonclassical LogicsAgata Ciabattoni, Nikolaos Galatos, Kazushige Terui. 229-240 [doi]
- Focusing on Binding and ComputationDaniel R. Licata, Noam Zeilberger, Robert Harper. 241-252 [doi]
- A First-Order Representation of Pure Type Systems Using SuperdeductionGuillaume Burel. 253-263 [doi]
- The Quest for a Logic Capturing PTIMEMartin Grohe. 267-271 [doi]
- On the Asymptotic Nullstellensatz and Polynomial Calculus Proof ComplexitySøren Riis. 272-283 [doi]
- On the Computational Complexity of Cut-ReductionKlaus Aehlig, Arnold Beckmann. 284-293 [doi]
- Maltsev + Datalog --> Symmetric DatalogVíctor Dalmau, Benoit Larose. 297-306 [doi]
- Caterpillar Duality for Constraint Satisfaction ProblemsCatarina Carvalho, Víctor Dalmau, Andrei A. Krokhin. 307-316 [doi]
- Quantified Constraints and Containment ProblemsHubie Chen, Florent R. Madelaine, Barnaby Martin. 317-328 [doi]
- Hiding Local State in Direct Style: A Higher-Order Anti-Frame RuleFrançois Pottier. 331-340 [doi]
- Typed Normal Form Bisimulation for Parametric PolymorphismSøren B. Lassen, Paul Blain Levy. 341-352 [doi]
- Reachability Games and Game Semantics: Comparing Nondeterministic ProgramsAndrzej S. Murawski. 353-363 [doi]
- Weak Topology and a Differentiable Operator for Lipschitz MapsAbbas Edalat. 364-375 [doi]
- A Logical Characterization of Individual-Based ModelsJames F. Lynch. 379-390 [doi]
- The Satisfiability Problem for Probabilistic CTLTomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera. 391-402 [doi]
- The Axiomatic Derivation of Absolute Lower BoundsYiannis N. Moschovakis. 405 [doi]
- Definable Tree DecompositionsMartin Grohe. 406-417 [doi]
- Hypergraph Acyclicity and Extension Preservation TheoremsDavid Duris. 418-427 [doi]
- From Automatic Structures to Borel StructuresGreg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies. 431-441 [doi]
- Piecewise Testable Tree LanguagesMikolaj Bojanczyk, Luc Segoufin, Howard Straubing. 442-451 [doi]
- Collapsible Pushdown Automata and Recursion SchemesMatthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre. 452-461 [doi]
- The Geometry of Interaction of Differential Interaction NetsMarc de Falco. 465-475 [doi]
- Correctness of Multiplicative Additive Proof Structures is NL-CompletePaulin Jacobé de Naurois, Virgile Mogbil. 476-485 [doi]
- Cut Elimination for Monomial MALL Proof NetsOlivier Laurent, Roberto Maieli. 486-497 [doi]
- A Neutral Approach to Proof and Refutation in MALLOlivier Delande, Dale Miller. 498-508 [doi]