FLoC '02 - ICC

ICC 2002

Implicit Computational Complexity
Copenhagen, Denmark, July 20-21, 2002
Affiliated with LICS 2002

Implicit Computational Complexity concerns the theory and application of logic-based, machine-independent approaches to computational complexity. These approaches have opened new ways of incorporating aspects of computational complexity into areas such as formal methods in software development, programming language design, and database theory.

The workshop seeks original research reports on advances in implicit computational complexity. Topics of interest include (but are not limited to):

automatic complexity analysis of programs
complexity analysis for functional languages
higher-type computational complexity
logical and machine-independent characterizations of complexity classes
logics closely related to complexity classes
software that applies ICC ideas in programming language design and in formal methods
type systems for controlling complexity

The ICC website is at http://www.cis.syr.edu/~royer/icc/

Invited speakers

Carl Christian Frederiksen and Neil D. Jones, U Copenhagen, Denmark
Program analysis for implicit computational complexity
Neil Immerman, U Massachusetts, USA
Descriptive programming
James S. Royer, Syracuse U, USA
Programs for feasible functionals
Paul J. Voda, Comenius U, Slovakia
Two simple intrinsic characterizations of main complexity classes

Program Committee

chair: James S. Royer <royer@ecs.syr.edu>
Dept. of Elec. Engrg. and Computer Science
Syracuse University
Syracuse NY 13244, USA
+1 315 443 1028
+1 315 443 1122 (fax)
Jean-Yves Girard, IML Marseille, France
Martin Hofmann, U Munich, Germany
Neil D. Jones, U Copenhagen, Denmark
Jean-Yves Marion, LORIA Nancy, France
Paul J. Voda, Comenius U, Slovakia

Steering Committee

Daniel Leivant <leivant@cs.indiana.edu>, Indiana U Bloomington, USA
Jean-Yves Marion <Jean-Yves.Marion@loria.fr>, LORIA Nancy, France