DICE 2016 - 7th International Workshop on Developments in Implicit Computational complExity

The area of implicit computational complexity (ICC) grew 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 the computational complexity of programs without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles entailing complexity properties. Several approaches have been explored for that purpose, like restrictions on primitive recursion and ramification, rewriting systems, linear logic, types and lambda calculus, interpretations of functional and imperative programs...The workshop is intended
to be a forum for researchers interested in ICC to present new results and discuss recent developments in this area.
Organizer: Patrick Baillot