Atlas home || Conferences | Abstracts | about Atlas
Homepage: http://www.cs.indiana.edu/icc99/
Email: icc99@cs.indiana.edu
Organizers: Stephen Bellantoni (Toronto), Samuel Buss (San Diego), Robert Constable (Cornell), Stephen Cook (Toronto), Anuj Dawar (Cambridge) (co-chair), Erich Graedel (Aachen), Yuri Gurevich (Microsoft), Lauri Hella (Helsinki), Neil Jones (DIKU Copenhagen), Clemens Lautemann (Mainz), Daniel Leivant (Indiana) (co-chair), Helmut Schwichtenberg (Munich), Jurek Tyszkiewicz (Warsaw and New South Wales)
Deadline for abstracts: March 02, 1999
Description:
The synergy between Logic and Computational Complexity has gained importance and vigor in recent years, cutting across areas such as Proof Theory, Finite
Model Theory, Computation Theory, Applicative Programming, Database Theory, and Philosophical Logic. Several machine-independent approaches to
computational complexity have been developed, which characterize complexity classes by conceptual measures borrowed primarily from mathematical logic.
Collectively these approaches might be dubbed implicit computational complexity. Practically, implicit computational complexity provide framework for a
streamlined incorporation of computational complexity into areas such as formal methods in software development, programming language theory, database
theory, and computer aided verification.
The mission of ICC'99 is to further the development of implicit computational complexity and its applications, in particular in database theory, functional programming languages, and formal methods in hardware and software design. In addition to research reports on advances in implicit computational complexity, the workshop will strive to facilitate the discovery of conceptual bridges and unifying principles.
The workshop is dedicated to the characterization, analysis, comparison, development, and implementation of computational complexity issues within the following areas and approaches. Descriptive complexity (finite model theory) Proof theory (e.g. bounded arithmetic, other weak theories, weak higher order logics, linear logic) Applicative formalisms (e.g. function algebras, ramified recurrence, control mechanisms in lambda calculi)
Date received: February 07, 1999
© 2008 Atlas Conferences Inc.