Preliminary program for the Implicit Complexity Workshop (ICC'02)

The Implicit Complexity Workshop (ICC'02) will be held on 20-21 July
2002 in Copenhagen.

ICC'02 is part of the Federated Logic Conference (FLOC'02) and
affiliated with the IEEE Symposium on Logic in Computer Science
(LICS 2002). 


==== Saturday July 20th ================================================

11:00-12:30  SESSION 1

 11:00 Paul J. Voda, Comenius U, Slovakia
         Program committee talk: Two simple intrinsic characterizations
         of main complexity classes 
 12:00 Olivier Bournez, Paulin de Naurois, and Jean-Yves Marion; LORIA
       Nancy, France 
         Safe recursion and calculus over an arbitrary structure

12:30-14:00  LUNCH

14:00-15:30  SESSION 2

 14:00 Carl Christian Frederiksen and Neil D. Jones, DIKU, U
         Program committee talk: Program analysis for implicit
         computational complexity 
 15:00 Lars Kristiansen, Oslo U College, Norway
         New recursion-theoretic characterizations of well known
         complexity classes 

15:30-16:00  REFRESHMENTS

16:00-17:00  SESSION 3

 16:00 Klaus Aehlig and Jan Johannsen, LMU Munich, Germany
         An elementary fragment of second-order lambda calculus
 16:30 Karl-Heinz Niggl, Techn. U of Ilmenau, Germany
         Control structures in programs and computational complexity

=== Sunday July 21st ================================================

09:00-10:30  SESSION 4

 09:00 James S. Royer, Syracuse U, USA
         Program committee talk: Programs for feasible functionals
 10:00 Ryan Williams, Cornell U, USA
         Abstract complexity in reflexive type theory

10:30-11:00  REFRESHMENTS

11:00-12:30  SESSION 5

 11:00 Paulo Oliva, BRICS, Aarhus, Denmark
         On modified bar recursion
 11:30 Daniel Leivant, Indiana U Bloomington, USA
         Facets of ramification

12:30-14:00  LUNCH

14:00-15:30  SESSION 6

 14:00 Niel Immerman, U Massachusetts, Amherst, USA
         Invited talk: Descriptive programming
 15:00 G. E. Ostrin, U Bern, Switzerland and S. S. Wainer, U Leeds, UK
         Computational complexity in a weak arithmetic

15:30-16:00  REFRESHMENTS

16:00-17:00  SESSION 7

 16:00 Maria Emilia Maittie, U Padova, Italy and Ritter, U
       Birmingham, UK 
         Normalization bounds in rudimentary linear lambda calculus
 16:30 Peter Moller Neergaard and Harry G. Mairson, Brandeis U, USA
         LAL is square: Representation and expressiveness in light
         affine logic 



  For the on-line FLoC registration, start here:

Workshop registration fees             

               Before June 15     From June 15
  Delegate     DKK 750/EUR 100    DKK 1125/EUR 150
  Student      DKK 375/EUR  50    DKK  565/EUR  75


  The workshop home page:    http://www.cis.syr.edu/~royer/icc
  The FLOC'02 home page:     http://floc02.diku.dk
  The LICS 2002 home page:   http://floc02.diku.dk/LICS

Program committee

  Jean-Yves Girard (Institut de Mathematiques de Luminy, Marseille) 
  Martin Hofmann (Ludwig-Maximilians-Universitat, Muenchen)
  Neil Jones (University of Copenhagen, Denmark)
  Jean-Yves Marion (Loria, Nancy, France)  
  James Royer (Syracuse University, Syracuse, NY, USA) (Chair)
  Paul Voda (Comenius University, Slovakia) 

Steering committee

  Daniel Leivant (University of Indiana at Bloomington)  
  Jean-Yves Marion (Loria, Nancy, France)