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. Examples are
descriptive complexity (finite model theory), bounded arithmetic, set-existence
principles, intrinsic theories, linear logics, and algebras of functions. 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, and database theory. The mission of the workshop 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.
Link to
the temporary W1 website
Topics
Program
Program Committee
Invited
and keynote speakers
Accepted
Papers
Registration
|
