From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@sympa.inria.fr Delivered-To: caml-list@sympa.inria.fr Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105]) by sympa.inria.fr (Postfix) with ESMTPS id 7156E7EE94; Thu, 27 Dec 2012 12:55:01 +0100 (CET) Received-SPF: None (mail4-smtp-sop.national.inria.fr: no sender authenticity information available from domain of ronchi@di.unito.it) identity=pra; client-ip=130.192.156.1; receiver=mail4-smtp-sop.national.inria.fr; envelope-from="ronchi@di.unito.it"; x-sender="ronchi@di.unito.it"; x-conformance=sidf_compatible Received-SPF: Pass (mail4-smtp-sop.national.inria.fr: domain of ronchi@di.unito.it designates 130.192.156.1 as permitted sender) identity=mailfrom; client-ip=130.192.156.1; receiver=mail4-smtp-sop.national.inria.fr; envelope-from="ronchi@di.unito.it"; x-sender="ronchi@di.unito.it"; x-conformance=sidf_compatible; x-record-type="v=spf1" Received-SPF: None (mail4-smtp-sop.national.inria.fr: no sender authenticity information available from domain of postmaster@pianeta.di.unito.it) identity=helo; client-ip=130.192.156.1; receiver=mail4-smtp-sop.national.inria.fr; envelope-from="ronchi@di.unito.it"; x-sender="postmaster@pianeta.di.unito.it"; x-conformance=sidf_compatible X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AmICAHQ23FCCwJwBgWdsb2JhbABFAhSCM4Nxrg2JGBYOAQEWJieCQgYdAQE4DQsvBw4CHUITiBMMiTmaBXCDSgEFjiUGBIxuc4IiMmGXK4oeiAOBbA X-IronPort-AV: E=Sophos;i="4.84,362,1355094000"; d="scan'208,217";a="166889379" Received: from pianeta.di.unito.it ([130.192.156.1]) by mail4-smtp-sop.national.inria.fr with ESMTP/TLS/DHE-RSA-AES256-SHA; 27 Dec 2012 12:55:00 +0100 X-MailScanner-From: ronchi@di.unito.it X-SpamCheck: not spam, SpamAssassin (not cached, score=-101.741, required 3, autolearn=not spam, AUTHENTICATEDUSER -100.00, AWL 0.07, BAYES_00 -1.90, HTML_MESSAGE 0.00, RCVD_IN_DNSWL_LOW -0.70, RDNS_NONE 0.79, SPF_PASS -0.00, TO_EQ_FM_DIRECT_MX 0.00) X-AntiVirus: Email Clean X-dipinfo-MailScanner-ID: qBRBohV2016906 X-dipinfo-MailScanner-Information: Please contact Department of Computer Science technical staff for more information Received: from pianeta.di.unito.it ([130.192.156.1]) by pianeta.di.unito.it (INFO-DIP) with ESMTP id qBRBohV2016906 (version=TLSv1/SSLv3 cipher=AES128-SHA bits=128 verify=NO AuthenticatedUser=ronchi ); Thu, 27 Dec 2012 12:50:44 +0100 (CET) X-DKIM: OpenDKIM Filter v2.4.1 pianeta.di.unito.it qBRBohV2016906 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=di.unito.it; s=dipinfo2011; t=1356609048; bh=D96mV5IRW/EwrRSmgsYZs9EWE/gnsikRWl5cLGDLNJQ=; h=From:Content-Type:Date:Subject:To:Message-Id:Mime-Version; b=fqCXQwGXjU6wD6L4NCSoDfoCzjO0kudFAmfErd6XX/Em9ZprfeNnn5J8UC5iWn+X2 Q6BhrMXInA6dX8/9i/9Hw+H40w/Sd13xIy7ujd2drA20i7hO6KacWDdZ3iIMdXqvo5 gnxSNdoaTJB3/xkwNvdRheUsGDpfgb2FqbiUXGLw= From: Simona Ronchi della Rocca Content-Type: multipart/alternative; boundary=Apple-Mail-36-344723113 Date: Thu, 27 Dec 2012 12:50:44 +0100 To: Simona Ronchi Message-Id: <568474A3-1333-4A75-A31C-D47F4AE4325E@di.unito.it> Mime-Version: 1.0 (Apple Message framework v1085) X-Mailer: Apple Mail (2.1085) X-Validation-by: ronchi@di.unito.it Subject: [Caml-list] DICE 2013 last call for papers --Apple-Mail-36-344723113 Content-Transfer-Encoding: quoted-printable Content-Type: text/plain; charset=utf-8 =C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2= =A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7= =C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7 DICE 2013 =C2=A7=C2=A7=C2= =A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7= =C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2= =A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7 (DEVELOPMENTS IN IMPLICIT COMPUTATIONAL C= OMPLEXITY) http://dice2013.di= .unito.it/ Roma, March 16= ,17 2013 satellite event o= f ETAPS 2013 =20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20= =20=20=20=20=20=20=20=20 call for= papers IMPORTANT DATES: submission: January 10, 2013 notification: January 25, 2013 final version due: February 14, 2013 INVITED: =E2=80=A3 Jean-Yves Marion (Loria - INPL Nancy) =E2=80=A3 Marko van Eekelen (Open University - Radboud University Nijmege= n) =E2=80=A3 Paul-Andr=C3=A9 Melli=C3=A8s (PPS, Paris) SCOPE: The area of Implicit Computational Complexity (ICC) has grown out from seve= ral proposals to use logic and formal methods to provide languages for complexity-bounde= d computation (e.g. Ptime, Logspace computation). It aims at studying computational comp= lexity without referring to external measuring conditions or a particular machine model, = but only by considering language restrictions or logical/computational principles impl= ying complexity properties.=20 This workshop focuses on ICC methods related to programs (rather than descr= iptive methods).=20 In this approach one relates complexity classes to restrictions on programm= ing paradigms=20 (functional programs, lambda calculi, rewriting systems), such as ramified = recurrence, weak=20 polymorphic types, linear logic and linear types, and interpretative measur= es. The two main=20 objectives of this area are: - to find natural implicit characterizations of various complexity classe= s of functions, thereby=20 illuminating their nature and importance; - to design methods suitable for static verification of program complexit= y. Therefore ICC is related on the one hand to the study of complexity classes= , and on the other=20 hand to static program analysis. The workshop will be open to contributions= on various aspects=20 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 =E2= =80=A8 (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 . Submissions of abstracts by PC members are allowed and encouraged. We plan = on not having pre-proceedings. =20 POST-PROCEEDINGS: An open call for post-proceedings, as special issue of=20 INFORMATION & COMPUTATION=20 will follow. PROGRAM COMMITTEE: =E2=80=A3 Roberto Amadio (Paris-Diderot) =E2=80=A3 Harry Mairson (Brandeis) =E2=80=A3 Virgile Mogbil (Paris 13) =E2=80=A3 Simona Ronchi Della Rocca (Torino) (Chair) =E2=80=A3 Luca Roversi (Torino) =E2=80=A3 Olha Shkaravska (Nijmegen) =E2=80=A3 Ulrich Sch=C3=B6pp (LMU) =E2=80=A3 Aleksy Shubert (Warsaw) =E2=80=A3 Jakob G. Simonsen (DIKU) STEERING COMMITTEE: =E2=80=A3 Patrick Baillot (ENS Lyon, CNRS) =E2=80=A3 Ugo Dal Lago (Universit=C3=A0 degli Studi di Bologna) =E2=80=A3 Martin Hofmann (Ludwig-Maximilians-Universit=C3=A4t M=C3=BCnchen) =E2=80=A3 Jean-Yves Marion (Loria - INPL Nancy) =E2=80=A3 Simona Ronchi Della Rocca (Universit=C3=A0 degli Studi di Torino)) ---------------------------------------- Simona Ronchi Della Rocca full Professor of=20=20 "Foundations of Computer Science" Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) e-mail : ronchi@di.unito.it phone: +39-011-6706734 fax : +39-011-751603 mobile: +39-320-4205121 http://www.di.unito.it/~ronchi --Apple-Mail-36-344723113 Content-Transfer-Encoding: quoted-printable Content-Type: text/html; charset=utf-8
=C2=A7=C2=A7=C2=A7=C2= =A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7= =C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2= =A7=C2=A7=C2=A7=C2=A7   DICE 2013    =C2=A7=C2=A7=C2=A7=C2= =A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7= =C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7=C2= =A7=C2=A7=C2=A7=C2=A7=C2=A7=C2=A7

    &n= bsp;                     =         (DEVELOPMENTS IN IMPLICIT COMPUTATIONAL COMPLEX= ITY)
                &nbs= p;                     &n= bsp;                  http://dice2013.di.unito.it/

                &n= bsp;                     =                      = ;  Roma, March 16,17 2013
         =                     &nbs= p;                     &n= bsp;     satellite event of ETAPS 2013
    &n= bsp;                     =        
          &n= bsp;                     =                      = ;              call for papers


IMPORTANT DATES:

su= bmission:            January 10, 2013
notification:             January 25, 2013=
final version due:    February 14, 2013

=
INVITED:

=E2=80=A3 Jean-Yves Marion (Loria - INP= L Nancy)
=E2=80=A3 Marko van Eekelen (Open University - Radboud University= Nijmegen)
=E2=80=A3 Paul-Andr=C3=A9 Melli=C3=A8s (PPS, Paris)
<= br>

SCOPE:

The area of Im= plicit Computational Complexity (ICC) has grown out from several proposals<= /div>
 to use logic and formal methods to provide languages for co= mplexity-bounded computation
 (e.g. Ptime, Logspace computat= ion). It aims at studying computational complexity without
 = referring to external measuring conditions or a particular machine model, b= ut only by
 considering language restrictions or logical/com= putational principles implying complexity properties. 
This = workshop focuses on ICC methods related to programs (rather than descriptiv= e methods). 
In this approach one relates complexity classes= to restrictions on programming paradigms 
(functional progr= ams, lambda calculi, rewriting systems), such as ramified recurrence, weak&= nbsp;
polymorphic types, linear logic and linear types, and inter= pretative measures. The two main 
objectives of this area ar= e:
- to find natural implicit characterizations of various complexity clas= ses of functions, thereby 
         = ;          illuminating their nature and importanc= e;
- to design methods suitable for static verification of program complex= ity.

Therefore ICC is related on the one hand to t= he study of complexity classes, and on the other 
hand to st= atic program analysis. The workshop will be open to contributions on variou= s 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 f= or implicit complexity,
- programming languages for complexity-bounded com= putation,
- application of implicit complexity to other programming paradi= gms  =E2=80=A8  (e.g. imperative or object-oriented languages).


SUBMISSIONS:

Authors are invited to submit an extended abstract, up to 5 pages.
<= div>Abstracts should be written in English, in the form of a PDF file uploa= ded to DICE 13 page at Easychair
Submissions of abstracts = by PC members are allowed and encouraged. We plan on not having pre-proceed= ings.
 
POST-PROCEEDINGS:

An open call for post-proceedings, as special issue of 
&nb= sp;                     &= nbsp;                   INFORM= ATION & COMPUTATION 
will follow.

PROGRAM COMMITTEE:

=E2=80=A3 Roberto Amadio (Pa= ris-Diderot)
=E2=80=A3 Harry Mairson (Brandeis)
=E2=80= =A3 Virgile Mogbil (Paris 13)
=E2=80=A3 Simona Ronchi Della Rocca= (Torino) (Chair)
=E2=80=A3 Luca Roversi (Torino)
=E2= =80=A3 Olha Shkaravska (Nijmegen)
=E2=80=A3 Ulrich Sch=C3=B6pp (L= MU)
=E2=80=A3 Aleksy Shubert (Warsaw)
=E2=80=A3 Jakob G= . Simonsen (DIKU)


STEERING COMMITTE= E:

=E2=80=A3 Patrick Baillot (ENS Lyon, CNRS)
=E2=80=A3 Ugo Dal Lago (Universit=C3=A0 degli Studi di Bologna)
=
=E2=80=A3 Martin Hofmann (Ludwig-Maximilians-Universit=C3=A4t M=C3=BCn= chen)
=E2=80=A3 Jean-Yves Marion (Loria - INPL Nancy)
= =E2=80=A3 Simona Ronchi Della Rocca (Universit=C3=A0 degli Studi di Torino)= )



= ----------------------------------------
Simona Ronchi Della Rocca
full= Professor of  
"Foundations of Computer Science"
Dipartimento di Informat= ica
<= i>Universita' di Torino
c.Svizzera 185, 10149 Torino (Italy)
=

phone: +39-011-6706734
fax : +39-011-751603
mobile: += 39-320-4205121

=


= --Apple-Mail-36-344723113--