Abstract is missing.
- The Search for Structure in Quantum ComputationPrakash Panangaden. 1-11 [doi]
- Coalgebraic Walks, in Quantum and Turing ComputationBart Jacobs. 12-26 [doi]
- Similarity Quotients as Final CoalgebrasPaul Blain Levy. 27-41 [doi]
- What Do Reversible Programs Compute?Holger Bock Axelsen, Robert Glück. 42-56 [doi]
- Irrelevance in Type Theory with a Heterogeneous Equality JudgementAndreas Abel. 57-71 [doi]
- When Is a Type Refinement an Inductive Type?Robert Atkey, Patricia Johann, Neil Ghani. 72-87 [doi]
- Complexity of Strongly Normalising ::::λ::::-Terms via Non-idempotent Intersection TypesAlexis Bernadet, Stéphane Lengrand. 88-107 [doi]
- Realizability and Parametricity in Pure Type SystemsJean-Philippe Bernardy, Marc Lasson. 108-122 [doi]
- Sound Bisimulations for Higher-Order Distributed Process CalculusAdrien Piérard, Eijiro Sumii. 123-137 [doi]
- Deriving Labels and Bisimilarity for Concurrent Constraint ProgrammingAndrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, Frank D. Valencia. 138-152 [doi]
- Ordinal Theory for Expressiveness of Well Structured Transition SystemsRémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa Velardo. 153-167 [doi]
- Alternation Elimination for Automata over Nested WordsChristian Dax, Felix Klaedtke. 168-183 [doi]
- Co-Büching Them AllUdi Boker, Orna Kupferman. 184-198 [doi]
- Minimizing Deterministic Lattice AutomataShulamit Halamish, Orna Kupferman. 199-213 [doi]
- Regularity and Context-Freeness over Word Rewriting SystemsDidier Caucal, Dinh Trong Hieu. 214-228 [doi]
- Quantitative Robustness Analysis of Flat Timed AutomataRémi Jaubert, Pierre-Alain Reynier. 229-244 [doi]
- A Game Approach to Determinize Timed AutomataNathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen. 245-259 [doi]
- A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion SchemesNaoki Kobayashi. 260-274 [doi]
- Church Synthesis Problem for Noisy InputYaron Velner, Alexander Rabinovich. 275-289 [doi]
- Probabilistic Modal ::::μ::::-Calculus with Independent ProductMatteo Mio. 290-304 [doi]
- A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric SpacesJan Schwinghammer, Lars Birkedal, Kristian Støvring. 305-319 [doi]
- A Modified GoI Interpretation for a Linear Functional Programming Language and Its AdequacyNaohiko Hoshino. 320-334 [doi]
- Estimation of the Length of Interactions in Arena Game SemanticsPierre Clairambault. 335-349 [doi]
- Synchronous Game Semantics via Round AbstractionDan R. Ghica, Mohamed N. Menaa. 350-364 [doi]
- Freshness and Name-Restriction in Sets of Traces with NamesMurdoch James Gabbay, Vincenzo Ciancia. 365-380 [doi]
- Polymorphic Abstract Syntax via Grothendieck ConstructionMakoto Hamana. 381-395 [doi]
- Asymptotic Information Leakage under One-Try AttacksMichele Boreale, Francesca Pampaloni, Michela Paolini. 396-410 [doi]
- A Trace-Based View on Operating GuidelinesChristian Stahl, Walter Vogler. 411-425 [doi]
- HTML Validation of Context-Free LanguagesAnders Møller, Mathias Schwarz. 426-440 [doi]
- On the Power of Cliques in the Parameterized Verification of Ad Hoc NetworksGiorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro. 441-455 [doi]
- The Reduced Product of Abstract Domains and the Combination of Decision ProceduresPatrick Cousot, Radhia Cousot, Laurent Mauborgne. 456-472 [doi]