TYPES 2008: Torino, Italy

• Davide Ancona, Giovanni Lagorio, Elena Zucca:
  Type Inference by Coinductive Logic Programming. 1-18
  
• Andrea Asperti, Wilmer Ricciotti:
  About the Formalization of Some Results by Chebyshev in Number Theory. 19-31
  
• Bruno Barras, Pierre Corbineau, Benjamin Grégoire, Hugo Herbelin, Jorge Luis Sacchini:
  A New Elimination Rule for the Calculus of Inductive Constructions. 32-48
  
• Juan Manuel Crespo, Gustavo Betarte, Carlos Luna:
  A Framework for the Analysis of Access Control Models for Interactive Mobile Devices. 49-63
  
• Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer:
  Proving Infinitary Normalization. 64-82
  
• Erik Ernst:
  First-Class Object Sets. 83-99
  
• José Espírito Santo, Ralph Matthes, Luis Pinto:
  Monadic Translation of Intuitionistic Sequent Calculus. 100-116
  
• Camillo Fiorentini, Alberto Momigliano, Mario Ornaghi:
  Towards a Type Discipline for Answer Set Programming. 117-135
  
• Marco Gaboardi, Simona Ronchi Della Rocca:
  Type Inference for a Polynomial Lambda Calculus. 136-152
  
• Florian Haftmann, Makarius Wenzel:
  Local Theory Specifications in Isabelle/Isar. 153-168
  
• Clément Houtmann:
  Axiom Directed Focusing. 169-185
  
• Dag Hovland:
  A Type System for Usage of Software Components. 186-202
  
• Cezary Kaliszyk, Freek Wiedijk:
  Merging Procedural and Declarative Proof. 203-219
  
• Yves Bertot, Ekaterina Komendantskaya:
  Using Structural Recursion for Corecursion. 220-236
  
• Zhaohui Luo:
  Manifest Fields and Module Mechanisms in Intensional Type Theory. 237-255
  
• Eelis van der Weegen, James McKinna:
  A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq. 256-271
  
• Milad Niqui:
  Coalgebraic Reasoning in Coq: Bisimulation and the lambda-Coiteration Scheme. 272-288
  
• Luca Paolini, Mauro Piccolo:
  A Process-Model for Linear Programs. 289-305
  
• Luca Roversi, Luca Vercelli:
  Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. 306-322