[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


              ------- Call for papers ---------
        Extended deadline => January 3rd, 2011


                Second International  Workshop on
  Developments in Implicit Computational complExity
                        (DICE 2011)


      April, 2nd-3rd, Saarbrücken, Germany
              as part of ETAPS 2011

=> Paper submission: January 3rd, 2011
* Notification date: January 27th, 2011
* Final version due: February 8th, 2011
* Workshop: April 2nd-3rd, 2011

  * Selected regular papers are planned to be published in EPTCS.
  * There will be a call for paper after the workshop for a special issue of 
Information and Computation.

  *  Martin Hofmann (Ludwig-Maximilians-Universität München)
  *  Daniel Leivant (Indiana University)
  * Ricardo Peña (Universidad complutense de Madrid)

There will be two categories of submissions:
  * Full papers: up to 15 pages (including bibliography).
 * Extended abstracts for short presentations (that will not be  included in 
the proceedings): up to 3 pages;
Authors must indicate if their submission belongs to the second  category (by 
mentioning "(Extended Abstract)" in the title).

Papers must be sumbitted electronically, as pdf files,  at the  following URL:
Submissions of the first category (full papers) should not have been  published 
before or submitted simultaneously
to another conference or journal. This restriction does not hold for  the 
second category (extended abstracts).
These latter submissions will be an opportunity to present work in  progress or 
to get a feedback from
the audience on a work already published elsewhere. Submissions of  papers 
authored by  PC members are allowed.


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 
(e.g. Ptime, Logspace computation). It aims at studying computational  
without referring to external measuring conditions or a particular  machine 
model, but
only by considering language restrictions or logical/computational  principles 
implying complexity
This workshop focuses on ICC methods related to programs (rather than  
descriptive methods).  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. The two main objectives of this area are:
- to find natural implicit characterizations of various complexity  classes of
functions, thereby illuminating their nature and importance;
- to design methods suitable for static verification of program  complexity.
Therefore  ICC is related on the one hand to the study of complexity
classes, and on the other hand to static program analysis.

The workshop will be open to contributions on various aspects of ICC  including 
not exclusively):
- 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)

The first DICE workshop ( http://www.ens-lyon.fr/LIP/DICE2010/) was held in 
2010 at ETAPS.  Before that, several meetings
on this topic had already been held with success in  Paris  in 2008
(WICC'08,  http://www-lipn.univ-paris13.fr/~mogbil/wicc08/  ), in  Marseille  
in 2006
(GEOCAL'06 workshop on Implicit computational complexity, 
http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html) ,
and Paris in 2004  (ICC and logic meeting,  

Amir Ben-Amram (Academic College of Tel-Aviv)
Patrick Baillot (ENS Lyon, CNRS)
Jean-Yves Marion (Université de Lorraine) (Chair)
Simone Martini (Università di Bologna)
Damiano Mazza (Université Paris 13)
Georg Moser (Universität Innsbruck)
Ricardo Peña (Universidad complutense de Madrid)
Luca Roversi (Università di Torino)
Jim Royer (Syracuse University)

Patrick Baillot (ENS Lyon, CNRS) (Chair)
Martin Hofmann (Ludwig-Maximilians-Universität München)
Jean-Yves Marion (Université de Lorraine)
Simona Ronchi Della Rocca (Università di Torino)

FINANCIAL SUPPORT: The workshop is partially supported by:
ANR project COMPLICE (Implicit Computational Complexity, Concurrency  and 
Extraction),  ANR-08-BLANC-0211-01.

CONTACT:  jean-yves.mar...@loria.fr

Reply via email to