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 mail2-relais-roc.national.inria.fr (mail2-relais-roc.national.inria.fr [192.134.164.83]) by sympa.inria.fr (Postfix) with ESMTPS id B9BE67EE7D for ; Mon, 18 May 2015 07:58:46 +0200 (CEST) Received-SPF: None (mail2-smtp-roc.national.inria.fr: no sender authenticity information available from domain of schoepp@tcs.ifi.lmu.de) identity=pra; client-ip=129.187.214.135; receiver=mail2-smtp-roc.national.inria.fr; envelope-from="schoepp@tcs.ifi.lmu.de"; x-sender="schoepp@tcs.ifi.lmu.de"; x-conformance=sidf_compatible Received-SPF: None (mail2-smtp-roc.national.inria.fr: no sender authenticity information available from domain of schoepp@tcs.ifi.lmu.de) identity=mailfrom; client-ip=129.187.214.135; receiver=mail2-smtp-roc.national.inria.fr; envelope-from="schoepp@tcs.ifi.lmu.de"; x-sender="schoepp@tcs.ifi.lmu.de"; x-conformance=sidf_compatible Received-SPF: None (mail2-smtp-roc.national.inria.fr: no sender authenticity information available from domain of postmaster@acheron.ifi.lmu.de) identity=helo; client-ip=129.187.214.135; receiver=mail2-smtp-roc.national.inria.fr; envelope-from="schoepp@tcs.ifi.lmu.de"; x-sender="postmaster@acheron.ifi.lmu.de"; x-conformance=sidf_compatible X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: A0B8AQATf1lVmYfWu4Fcg2ReAYMdwyeHGDwQAQEBAQEBAREBAQEBAQgLCwchLoRGBkUQPRYLAgsDAgECAUsNBgIBAYgoBAmjPo9XpC2PURmDRIFFBZRzgUNeiDCGAwOEcoovgQRyATYcFYE/bQGCRQEBAQ X-IPAS-Result: A0B8AQATf1lVmYfWu4Fcg2ReAYMdwyeHGDwQAQEBAQEBAREBAQEBAQgLCwchLoRGBkUQPRYLAgsDAgECAUsNBgIBAYgoBAmjPo9XpC2PURmDRIFFBZRzgUNeiDCGAwOEcoovgQRyATYcFYE/bQGCRQEBAQ X-IronPort-AV: E=Sophos;i="5.13,451,1427752800"; d="asc'?scan'208";a="151086488" Received: from acheron.ifi.lmu.de ([129.187.214.135]) by mail2-smtp-roc.national.inria.fr with ESMTP/TLS/ADH-AES256-SHA; 18 May 2015 07:58:32 +0200 Received: from [192.168.0.2] (port-92-194-46-245.dynamic.qsc.de [92.194.46.245]) (using TLSv1 with cipher DHE-RSA-AES128-SHA (128/128 bits)) (No client certificate requested) (Authenticated sender: schoepp) by acheron.ifi.lmu.de (Postfix) with ESMTPSA id C36B294A14B for ; Mon, 18 May 2015 07:58:31 +0200 (CEST) Message-ID: <55597F87.4030208@tcs.ifi.lmu.de> Date: Mon, 18 May 2015 07:58:31 +0200 From: =?UTF-8?B?VWxyaWNoIFNjaMO2cHA=?= User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:31.0) Gecko/20100101 Thunderbird/31.6.0 MIME-Version: 1.0 To: Caml-list Content-Type: multipart/signed; micalg=pgp-sha512; protocol="application/pgp-signature"; boundary="BuC93oGMNcPdCn4NbkOoE5aidHGwAVcOg" Subject: [Caml-list] CFP: Information and Computation special issue on Implicit Computational Complexity This is an OpenPGP/MIME signed message (RFC 4880 and 3156) --BuC93oGMNcPdCn4NbkOoE5aidHGwAVcOg Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: quoted-printable =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Call for Papers INFORMATION & COMPUTATION Special Issue on Implicit Computational Complexity (open post-conference publication of the workshops DICE 2014 and DICE 2015) Deadline: July 1st 2015 Guest Editors: Marco Gaboardi Ulrich Sch=C3=B6pp =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D The area of Implicit Computational Complexity has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (such as polynomial time, polynomial space or logarithmic space computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of language restrictions or logical/computational principles implying complexity properties. We welcome contributions on various aspects of Implicit Computational Complexity, including (but not exclusively) the following topics: - types for controlling complexity - logical systems for implicit computational complexity - linear logic - semantics of complexity-bounded computation - complexity analysis - 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) - application of implicit complexity to security This special issue of Information & Computation follows the informal workshops on Developments in Implicit Computational Complexity (DICE), DICE 2014 in Grenoble (http://dice14.tcs.ifi.lmu.de) and DICE 2015 in London (http://dice15.computing.dundee.ac.uk). Submission to this special issue is open to everyone, including those who did not participate in DICE 2014 or DICE 2015. DICE workshops have been held annually as satellite events of ETAPS: DICE 2010 in Paphos, DICE 2011 in Saarbr=C3=BCcken, DICE 2012 in Tallinn, DICE 2013 in Rome, DICE 2014 in Grenoble and DICE 2015 in London. Previous post-conference publications have appeared in - Information & Computation for DICE 2011, - Theoretical Computer Science for DICE 2012 (in press), and - Information & Computation for DICE 2013 (to appear). More information on the DICE workshop series is available at: http://perso.ens-lyon.fr/patrick.baillot/DICE Information & Computation solicits high quality papers reporting research results related to the topics mentioned above. All papers must be original, unpublished, and not submitted for publication elsewhere. - Contributions should be submitted electronically to both addresses and . - Papers must be in PDF format and be formatted using Elsevier's elsarticle.cls LaTeX macro package. Formatting instructions can be found at http://www.elsevier.com/author-schemas/latex-instructions - Submissions must be sent to us no later than JULY 1st 2015. Papers will be processed as soon as they are submitted. We are aiming for a turnaround of no more than six months. We encourage authors to look at the author guide at http://www.elsevier.com/journals/information-and-computation/0890-5401/guid= e-for-authors --BuC93oGMNcPdCn4NbkOoE5aidHGwAVcOg Content-Type: application/pgp-signature; name="signature.asc" Content-Description: OpenPGP digital signature Content-Disposition: attachment; filename="signature.asc" -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQEcBAEBCgAGBQJVWX+HAAoJEGXFPOSpuhK+gYsH/iM5TwxRNl5EJJslvU10U2Cy 8n6iUBHn/EWgPV+Pn207PKsVTV8ImmeNPq5ZVUy/ZFRVcpi0ma9M4pgU1HHluWN7 ZaZltpWyECssYzltgEIwPUmkp6EoC4Nicn1paamnFArAGWtgO8I6UwOHH221BN3u TuKZiW6wbuej9p6nIP992YVxSGbOWCi9yeEg1vvBGnbNMbMuARH50n4aNAnDc6Qe cFCGBwpTheIQ6ViAgvO1Q204GG3nQc2iGA/NWwCHbbNAtrVoSe1DF5rmcLmghIpR 1Wm70C7zQHN7IAKSOAIrK05Y0oLIhZfXnXW8rsUBBrjFvAKVV+PcpU4c+0EPL1s= =QAJ9 -----END PGP SIGNATURE----- --BuC93oGMNcPdCn4NbkOoE5aidHGwAVcOg--