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 mail1-relais-roc.national.inria.fr (mail1-relais-roc.national.inria.fr [192.134.164.82]) by sympa.inria.fr (Postfix) with ESMTPS id 5AB947F1C3; Sat, 24 Nov 2012 16:03:15 +0100 (CET) Received-SPF: None (mail1-smtp-roc.national.inria.fr: no sender authenticity information available from domain of ronchi@di.unito.it) identity=pra; client-ip=130.192.156.1; receiver=mail1-smtp-roc.national.inria.fr; envelope-from="ronchi@di.unito.it"; x-sender="ronchi@di.unito.it"; x-conformance=sidf_compatible Received-SPF: Pass (mail1-smtp-roc.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=mail1-smtp-roc.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 (mail1-smtp-roc.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=mail1-smtp-roc.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: AqYCAMfgsFCCwJwBgWdsb2JhbABEAhSCM4NfsQoBiQoWDgEBFiYngkIGHQEBOBgvBwQBCQJfiCAMqx1wg0cBBY5KBo1FgiAyYZcgihuHfQ X-IronPort-AV: E=Sophos;i="4.83,313,1352070000"; d="scan'208,217";a="182975555" Received: from pianeta.di.unito.it ([130.192.156.1]) by mail1-smtp-roc.national.inria.fr with ESMTP/TLS/DHE-RSA-AES256-SHA; 24 Nov 2012 16:03:14 +0100 X-MailScanner-From: ronchi@di.unito.it X-SpamCheck: not spam, SpamAssassin (not cached, score=-101.161, required 3, autolearn=not spam, AUTHENTICATEDUSER -100.00, AWL -0.51, BAYES_00 -1.90, HTML_MESSAGE 0.00, HTML_TAG_BALANCE_BODY 1.16, 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: qAOEYbTG016538 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 qAOEYbTG016538 (version=TLSv1/SSLv3 cipher=AES128-SHA bits=128 verify=NO AuthenticatedUser=ronchi ); Sat, 24 Nov 2012 15:34:37 +0100 (CET) X-DKIM: OpenDKIM Filter v2.4.1 pianeta.di.unito.it qAOEYbTG016538 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=di.unito.it; s=dipinfo2011; t=1353767788; bh=Zy0/UT73VyTvQws8hK8Xo1jdloReyGj8vPJ8zYCsQBA=; h=From:Content-Type:Date:Subject:To:Message-Id:Mime-Version; b=ZoZCGYHCfASN+J+r2QJMIbR29gvHOMgjnBzAgSA4s4/d26+hoN1glqpmZIKxzGbbp ZLVjlXaRYF+CCy/P3t/lJHbMWPgozSgu/QH7y/VM4Ts52eQHiYNiGzk/HwkS4DaW8f gJPc9nCW/o9KMNfI8G9qLG1H/Ws/qzr5bp3QpNos= From: Simona Ronchi della Rocca Content-Type: multipart/alternative; boundary=Apple-Mail-1--349161802 Date: Sat, 24 Nov 2012 15:34:36 +0100 To: Simona Ronchi Message-Id: 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, second call for papers --Apple-Mail-1--349161802 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.d= i.unito.it/index.html 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 Nijmegen) =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 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=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=20=20 (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)) --Apple-Mail-1--349161802 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
              &nbs= p;                   (DEVELOPM= ENTS IN IMPLICIT COMPUTATIONAL COMPLEXITY)
   = ;                     &nb= sp;                     &= nbsp;           http://dic= e2013.di.unito.it/index.html
             = ;                     &nb= sp;                     &= nbsp;    Roma, March 16,17 2013
   =                     &nbs= p;                     &n= bsp;           satellite event of ETAPS 2013
=

                  &n= bsp;              

&nb= sp;                     &= nbsp;                    =                     &nbs= p;  call for papers


IMPORTANT DATES:
submission:            Janu= ary 10, 2013
notification:         =     January 25, 2013
final version due:  = ;  February 14, 2013

<= div style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin= -left: 0px; font: normal normal normal 16px/normal Helvetica; color: rgb(21= , 79, 174); ">INVITED:



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 compu= tation
 (e.g. Ptime, Logspace computation). I= t aims at studying computational complexity without
 referring to external measuring conditions or a particular machine= model, but only by
 considering language res= trictions or logical/computational principles implying complexity propertie= s. 
This workshop focuses on ICC methods rela= ted to programs (rather than descriptive methods). 
In this approach one relates complexity classes to restrictions on p= rogramming paradigms 
(functional programs, l= ambda calculi, rewriting systems), such as ramified recurrence, weak <= /span>
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 co= mplexity classes of functions, thereby illuminating their nature and import= ance;
  • - to design methods suitable for static verification of pr= ogram complexity.

Therefore= ICC is related on the one hand to the study of complexity classes, and on = the other 
hand to static program analysis. T= he 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 obj= ect-oriented languages).


SUBMISSIONS:

Authors are invited to submit an extended abs= tract, 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 pl= an on not having pre-proceedings.

 

<= div style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin= -left: 0px; text-align: justify; line-height: 17px; font: normal normal nor= mal 15px/normal Arial; color: rgb(82, 82, 82); ">POST-PROCEEDINGS:

An open call for post-proceedings, as special issue of <= /div>
                &= nbsp;                    =     INFORMATION & COMPUTATION 
will follow.

PROGRAM COMMITTEE:

=
=E2=80=A3 Roberto Amadio (Paris-Diderot)<= /span>
=E2= =80=A3 Harry Mairson (Brande= is)
=E2=80=A3 Virgile Mogbil (P= aris 13)
=E2=80=A3 Simona Ronchi Della Rocca (Torino) (Chair)
<= span class=3D"Apple-style-span" style=3D"color: rgb(89, 76, 77); font-famil= y: Arial; font-size: 15px; ">=E2=80=A3 Luc= a Roversi (Torino)
=E2=80=A3 Olha Shka= ravska (Nijmegen)
=E2=80=A3 Ulri= ch Sch=C3=B6pp (LMU)
=E2=80=A3 Aleksy = Shubert (Warsaw)
=E2=80=A3 Jakob G. Si= monsen (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-M= aximilians-Universit=C3=A4t M=C3=BCnchen)
=E2=80=A3 Jean-Yves Marion&nbs= p;(Loria - INPL Nancy)
=E2= =80=A3 Simona= Ronchi Della Rocca (Univ= ersit=C3=A0 degli Studi di Torino))




= --Apple-Mail-1--349161802--