CONTRIBUTED PAPERS TO APPEAR

• Klaus Aehlig and Jan Johannsen, LMU Munich, Germany
  An elementary fragment of second-order lambda calculus
  
  
• Olivier Bournez, Paulin de Naurois, and Jean-Yves Marion; LORIA Nancy, France
  Safe recursion and calculus over an arbitrary structure
  
  
• Lars Kristiansen, Oslo U College, Norway
  New recursion-theoretic characterizations of well known complexity classes
  
  
• Daniel Leivant, Indiana U Bloomington, USA
  Facets of ramification
  
  
• Maria Emilia Maietti, U Padova, Italy, Valeria de Paiva, PARC, USA, and Eike Ritter, U Birmingham, UK
  Normalization bounds in rudimentary linear lambda calculus
  
  
• Peter Møller Neergaard and Harry G. Mairson, Brandeis U, USA
  LAL is square: Representation and expressiveness in light affine logic
  
  
• Karl-Heinz Niggl, Techn. U of Ilmenau, Germany
  Control structures in programs and computational complexity
  
  
• Paulo Oliva, BRICS, Aarhus, Denmark
  On modified bar recursion
  
  
• G. E. Ostrin, U Bern, Switzerland and S. S. Wainer, U Leeds, UK
  Computational complexity in a weak arithmetic
  
  

INVITED PAPERS TO APPEAR

• Paul J. Voda, Comenius U, Slovakia
  Two simple intrinsic characterizations of main complexity classes