22. CSL 2008: Bertinoro, Italy

Invited Talks

• Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
  The Computability Path Ordering: The End of a Quest. 1-14
  
• Pierre-Louis Curien:
  The Joy of String Diagrams. 15-22
  
• Wolfgang Thomas:
  Model Transformations in Decidability Proofs for Monadic Theories. 23-31
  
• Luca Cardelli:
  Molecules as Automata. 32
  

Contributed Papers

• Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
  An Infinite Automaton Characterization of Double Exponential Time. 33-48
  
• Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
  Recursion Schemata for NCk. 49-63
  
• Pierre McKenzie, Michael Thomas, Heribert Vollmer:
  Extensional Uniformity for Boolean Circuits. 64-78
  
• Martin Hofmann, Ulrich Schöpp:
  Pure Pointer Programs with Iteration. 79-93
  
• Witold Charatonik, Michal Wrona:
  Quantified Positive Temporal Constraints. 94-108
  
• Nadia Creignou, Henning Schnoor, Ilka Schnoor:
  Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. 109-123
  
• Ruzica Piskac, Viktor Kuncak:
  Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars. 124-138
  
• Gaëlle Fontaine:
  Continuous Fragment of the mu-Calculus. 139-153
  
• Alexis Saurin:
  On the Relations between the Syntactic Theories of lambda-mu-Calculi. 154-168
  
• Olivier Hermant, James Lipton:
  A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms. 169-183
  
• Phuong Nguyen:
  Proving Infinitude of Prime Numbers Using Binomial Coefficients. 184-198
  
• Olaf Beyersdorff, Sebastian Müller:
  A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. 199-214
  
• Stefano Berardi, Ugo de'Liguoro:
  A Calculus of Realizers for EM1 Arithmetic (Extended Abstract). 215-229
  
• Ugo Dal Lago, Olivier Laurent:
  Quantitative Game Semantics for Linear Logic. 230-245
  
• Paolo Tranquilli:
  A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic. 246-261
  
• Masahiro Hamano, Ryo Takemura:
  An Indexed System for Multiplicative Additive Polarized Linear Logic. 262-277
  
• Shin-ya Katsumata:
  A Characterisation of Lambda Definability with Sums Via TT-Closure Operators. 278-292
  
• Matthias Horbach, Christoph Weidenbach:
  Superposition for Fixed Domains. 293-307
  
• Ian Hodkinson, Angelo Montanari, Guido Sciavicco:
  Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T. 308-322
  
• Rémi Brochenin, Stéphane Demri, Étienne Lozes:
  On the Almighty Wand. 323-338
  
• Tomer Kotek, Johann A. Makowsky, Boris Zilber:
  On Counting Generalized Colorings. 339-353
  
• Anuj Dawar, Erich Grädel:
  The Descriptive Complexity of Parity Games. 354-368
  
• Sven Schewe:
  An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games. 369-384
  
• Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
  Quantitative Languages. 385-400
  
• Thomas Place:
  Characterization of Logics over Ranked Tree Languages. 401-415
  
• Thomas Colcombet, Christof Löding:
  The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. 416-430
  
• Jochen Eisinger:
  Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract). 431-445
  
• Andreas Abel, Dulma Rodriguez:
  Syntactic Metatheory of Higher-Order Subtyping. 446-460
  
• Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta:
  On Isomorphisms of Intersection Types. 461-477
  
• Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano:
  Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence. 478-492
  
• Gilles Barthe, Benjamin Grégoire, Colin Riba:
  Type-Based Termination with Sized Products. 493-507
  
• Johann A. Makowsky, Damian Niwinski:
  The Ackermann Award 2008. 508-512
  

Last update Sat May 18 18:19:20 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page