DICE 2016: Call for contributions

DICE 2016: Call for contributions

[Damiano Mazza]

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

_____________________________________________________________________

                             DICE 2016
Seventh Workshop on Developments in Implicit Computational Complexity
_____________________________________________________________________

                http://lipn.univ-paris13.fr/DICE2016

                     Eindhoven, The Netherlands
                          April 2-3, 2016
                     (satellite of ETAPS 2016)


Invited Speakers
----------------

* Robin Cockett, University of Calgary
* David Nowak, University of Lille


Important Dates
---------------

* Abstract Submission: Jan 31, 2016
* Notification:        Feb 21, 2016
* Final Version:       Mar 10, 2016


Scope
-----

DICE is a thematic workshop in the field of Implicit Computational 
Complexity, where researchers in the area can meet and discuss their 
most recent results. It takes place annually as part of ETAPS.

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 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.

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
- linear logic
- semantics of complexity-bounded computation
- rewriting and termination orderings
- interpretation-based methods for implicit complexity
- programming languages for complexity-bounded computation
- theoretical foundations of program complexity analysis
- application of implicit complexity to security


Submission
----------
Authors are invited to submit an extended abstract of up to 5 pages, 
which must be written in English and be submitted as a single PDF file 
to the following page:

https://www.easychair.org/conferences/conference_dir.cgi?a=9946461

Submissions will be judged on originality, relevance, interest and 
clarity.  Accepted abstracts will be presented at the workshop. 
Abstracts may contain material already published elsewhere before the 
workshop.  Preference will be given to abstracts containing novel work 
(including work in progress).

The workshop will not have formal proceedings and is not intended to 
preclude later publication at another venue.

Submissions of abstracts by PC members are allowed.


Program Committee
-----------------

* Dan Ghica (University of Birmingham)
* Emmanuel Hainry (Université de Lorraine)
* Damiano Mazza (CNRS - Université Paris 13) (Chair)
* Ramyaa (New Mexico Tech)
* Claudio Sacerdoti Coen (Università di Bologna)
* Thomas Seiller (University of Copenhagen)
* Lorenzo Tortora de Falco (Università Roma Tre)


Steering Committee
------------------

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