FLoC '02 - ICC program

ICC program

All sessions take place in auditorium 8.

Saturday's program is also available with abstracts or side by side with other meetings.

11:00-12:30 Session 1

11:00	Paul J. Voda, Comenius U, Slovakia Invited 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, U Copenhagen, Denmark Invited 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, U 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's program is also available with abstracts or side by side with other meetings.

11:00-12:30 Session 4

11:00	James S. Royer, Syracuse U, USA Invited talk: Programs for feasible functionals
12:00	Paulo Oliva, U Aarhus, Denmark On modified bar recursion

12:30-14:00 Lunch

14:00-15:30 Session 5

14:00	Neil Immerman, U Massachusetts, 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:30 Session 6

16:00	Daniel Leivant, Indiana U Bloomington, USA Facets of ramification
16:30	Maria Emilia Maietti, U Padova, Italy and Eike Ritter, U Birmingham, UK Normalization bounds in rudimentary linear lambda calculus
17:00	Peter Møller Neergaard and Harry G. Mairson, Brandeis U, USA LAL is square: Representation and expressiveness in light affine logic