Scope :

The area of Implicit Computational Complexity (ICC) has grown out from  several proposals to

use logic and formal methods to provide languages for complexity- bounded computation

(e.g. Ptime, Logspace computation). It aims at studying computational  complexity

without referring to external measuring conditions or a particular  machine model, but

only by considering language restrictions or logical/computational  principles implying complexity properties.

Contributions on various aspects of ICC  including (but not exclusively) are welcome : 

- types for controlling complexity,

- logical systems for implicit computational complexity,

- linear logic,

- semantics of complexity-bounded computation,

- rewriting and termination orderings,

- interpretation-based methods for implicit complexity,

- programming languages for complexity bounded computation, 

- application of implicit complexity to other programming paradigms  (e.g. imperative or object-oriented languages)

This special issue is a post-conference publication of DICE workshop. The first DICE workshop was held in 2010 in Lyon, the second in Saarbrucken in 2011, and the next one in Tallinn ( in 2012, as  satellite events of ETAPS.

A survey on ICC by P. Baillot, M. Hofmann, D. Leivant, J-Y Marion and S. Ronchi della Rocca is planned.


Submissions, in pdf format, must be sent to Jean-Yves Marion no later than

January, 31st, 2012

We encourage to look at Information and Computation site

and  the use of Elsevier's elsarticle.cls latex macro package,