Following the success of the GEOCAL workshop on ICC, there will be a special issue of the ACM Transactions on Computational Logic (TOCL).Submissions for this special issue are hereby solicited to participants of the workshop, but also to other contributors. The workshop was held on February 13-17 2006 in Marseille (France) as part of the Geometry of Computation 2006 meeting (series of lectures and workshops) organized by the GEOCAL project.
Implicit Computational Complexity (ICC) has emerged from various propositions to use logic and formal methods like types, rewriting
systems... to provide languages for complexity-bounded computation. It aims at studying the computational complexity of programs without referring to a particular machine model and explicit bounds on time or memory, but instead by relying on logical or computational principles that entail complexity properties. Several approaches have been explored for that purpose, like linear logic, restrictions on primitive recursion, rewriting systems, types and lambda-calculus... Two objectives of ICC are:
Submissions consist in either
All submissions will be acknowledged. Submitted papers must be original and not submitted for publication. Submissions will be refereed according to the usual very high standards of TOCL.
Deadline for submissions : 30 September 2006 -- New !!
Notification : 31 December 2006
Final manuscrits : 1st April 2007
Patrick Baillot, Université Paris 13, LIPN, email : patrick.baillot 'at' lipn.univ-paris13.fr
Jean-Yves Marion, Ecole des Mines de Nancy, LORIA-INPL, email : Jean-Yves.Marion 'at' loria.fr
Simona Ronchi Della Rocca, Università di Torino, email : ronchi'at'di.unito.it