[Agda] DICE 2013 - call-for partcipation

Simona Ronchi della Rocca ronchi at di.unito.it
Wed Feb 13 10:30:36 CET 2013

§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§   DICE 2013    §§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§


                                                             Roma, March 16,17 2013
                                                          satellite event of ETAPS 2013
                                                                   call for participation


submission:            January 10, 2013
notification:             January 25, 2013
final version due:    February 14, 2013


		‣ Jean-Yves Marion (Loria - INPL Nancy)
		‣ Marko van Eekelen (Open University - Radboud University Nijmegen)
		‣ Paul-André Melliès (PPS, Paris)


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 computation
 (e.g. Ptime, Logspace computation). It aims at studying computational complexity without
 referring to external measuring conditions or a particular machine model, but only by
 considering language restrictions or logical/computational principles implying complexity properties. 
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 (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,
		- application of implicit complexity to other programming paradigms  
  (e.g. imperative or object-oriented languages).


An open call for post-proceedings, as special issue of 
                                          INFORMATION & COMPUTATION 
will follow.


‣ Roberto Amadio (Paris-Diderot)
‣ Harry Mairson (Brandeis)
‣ Virgile Mogbil (Paris 13)
‣ Simona Ronchi Della Rocca (Torino) (Chair)
‣ Luca Roversi (Torino)
‣ Olha Shkaravska (Nijmegen)
‣ Ulrich Schöpp (LMU)
‣ Aleksy Shubert (Warsaw)
‣ Jakob G. Simonsen (DIKU)


‣ Patrick Baillot (ENS Lyon, CNRS)
‣ Ugo Dal Lago (Università degli Studi di Bologna)
‣ Martin Hofmann (Ludwig-Maximilians-Universität München)
‣ Jean-Yves Marion (Loria - INPL Nancy)
‣ Simona Ronchi Della Rocca (Università degli Studi di Torino))

Simona Ronchi Della Rocca
full Professor of  
"Foundations of Computer Science"
Dipartimento di Informatica
Universita' di Torino
c.Svizzera 185, 10149 Torino (Italy)

e-mail :  ronchi at di.unito.it
phone: +39-011-6706734
fax : +39-011-751603
mobile: +39-320-4205121


-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.chalmers.se/pipermail/agda/attachments/20130213/7d1bed71/attachment-0001.html

More information about the Agda mailing list