[TYPES/announce] Preliminary program for LCC'06

[James S. Royer]

The following is a preliminary program for LCC'06 (the 2006 Workshop
on Logic and Computational Complexity) which is part of FLoC 2006
(the Federated Logic Conference).

The deadline for early registration for LCC'06 and FLoC 2006 is
**Monday, July 10**.  See http://www.easychair.org/FLoC-06/ for
on-line registration.

For updates on this prelimary program, check
              http://www.easychair.org/FLoC-06/LCC.html

====================================================================
LCC'06 PRELIMINARY PROGRAM

                        Thursday, August 10th

SESSION 1:   INVITED TALK

09:30-10:30  TBA

10:30-11:00  Break

SESSION 2:   CONTRIBUTED TALKS

11:00-11:45  Patrick Baillot, Ugo Dal Lago and Jean-Yves Moyen
                On Quasi-Interpretations, Blind Abstractions and
                Implicit Complexity
11:45-12:30  Jean-Yves Marion and Pechoux Romain
                Quasi-friendly sup-interpretations

12:30-14:00  Lunch break

SESSION 3:   CONTRIBUTED TALKS

14:00-14:45  Antonina Kolokolova, Yongmei Liu, David Mitchell and
              Eugenia Ternovska
                Complexity of Expanding a Finite Structure and
                Related Tasks
14:45-15:30  Murray Patterson, Yongmei Liu, Eugenia Ternovska and
              Arvind Gupta
                Grounding for Model Expansion in k-Guarded Formulas

15:30-16:00  Break

SESSION 4:   INVITED TALK

16:00-17:00  TBA

                         Friday, August 11th

SESSION 5:   INVITED TALK

09:30-10:30  TBA

10:30-11:00  Break

SESSION 6:   CONTRIBUTED TALKS

11:00-11:45  Patrick Baillot and Marco Pedicini
                An Embedding of the BSS Model of Computation in Light
                Affine Lambda-Calculus
11:45-12:30  Yevgeniy Makarov
                Comparing efficiency of functions provable in
                classical and constructive logics

12:30-14:00  Lunch break

SESSION 7:   CONTRIBUTED TALK

14:00-14:45  Johann A. Makowsky
                Logical and Computational Aspects of Graph
                Polynomials: A Survey
====================================================================