§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§ DICE 2013
§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§§
(DEVELOPMENTS IN IMPLICIT COMPUTATIONAL
COMPLEXITY)
http://dice2013.di.unito.it/index.html
Roma, March 16,17
2013
satellite event of
ETAPS 2013
call for
papers
IMPORTANT DATES:
submission: January 10, 2013
notification: January 25, 2013
final version due: February 14, 2013
INVITED:
‣ Jean-Yves Marion (Loria - INPL Nancy)
‣ Marko van Eekelen (Open University - Radboud University Nijmegen)
‣ Paul-André Melliès (PPS, Paris)
SCOPE:
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).
SUBMISSIONS:
Authors are invited to submit an extended abstract, up to 5 pages.
Abstracts should be written in English, in the form of a PDF file uploaded to
DICE 13 page at Easychair
<https://www.easychair.org/account/signin.cgi?conf=dice2013>.
Submissions of abstracts by PC members are allowed and encouraged. We plan on
not having pre-proceedings.
POST-PROCEEDINGS:
An open call for post-proceedings, as special issue of
INFORMATION & COMPUTATION
will follow.
PROGRAM COMMITTEE:
‣ 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)
STEERING COMMITTEE:
‣ 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))
------------------------------------------------------------------------------
Monitor your physical, virtual and cloud infrastructure from a single
web console. Get in-depth insight into apps, servers, databases, vmware,
SAP, cloud infrastructure, etc. Download 30-day Free Trial.
Pricing starts from $795 for 25 servers or applications!
http://p.sf.net/sfu/zoho_dev2dev_nov
_______________________________________________
hol-info mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/hol-info
