DICE 2015 - 6th Developments in Implicity Computational ComplExity (DICE)

The area of Implicit Computational Complexity (ICC) has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (e.g. PTIME, LOGSPACE computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of language restrictions or logical/computational principles implying complexity properties.
This workshop focuses on ICC methods related to programs. Traditionally, in this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. This year we also aim at enlarge the scope of DICE to other research areas loosely related to ICC.
The workshop will be open to contributions on various aspects of ICC including (but not exclusively):
types for controlling complexity
logical systems for implicit computational complexity
semantics of complexity-bounded computation
interpretation-based methods for implicit complexity
programming languages for complexity-bounded computation
theoretical foundations of program complexity analysis
rewriting and termination orderings
proof complexity and deep inference
application of implicit complexity to security
amortized complexity analysis
linear logic
Organiser: Marco Gaboardi (PC chair) (m.gaboardi-AT-dundee.ac.uk)