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

Program Committee

Steering Committee