From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: *** X-Spam-Status: No, score=3.5 required=5.0 tests=DNS_FROM_RFC_POST,HTML_00_10, HTML_MESSAGE,SPF_NEUTRAL autolearn=disabled version=3.1.3 Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105]) by yquem.inria.fr (Postfix) with ESMTP id 071E9BBAF for ; Fri, 22 May 2009 07:33:50 +0200 (CEST) X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AkkGAK/VFUpKfS4fkGdsb2JhbACCHzOUUT8CAQEJCQwHEQOoXIETkG4BAwEEhAcFiDc X-IronPort-AV: E=Sophos;i="4.41,231,1241388000"; d="scan'208";a="40364292" Received: from yw-out-2324.google.com ([74.125.46.31]) by mail4-smtp-sop.national.inria.fr with ESMTP; 22 May 2009 07:33:49 +0200 Received: by yw-out-2324.google.com with SMTP id 9so892964ywe.3 for ; Thu, 21 May 2009 22:33:48 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:mime-version:received:date:message-id:subject :from:to:content-type; bh=qwdyjfA5TU3gm2ejmcIRxU7jff7WFWb2JmoRm2JwbiM=; b=YTU0ctKdBHDUaedajVw2+YWf/Sezo4hFS6oDRVAFgZ/TIvTAatvRPio5AmfuIm42TW COT6WDIUpDUliRQpujfTdLuH5y7EkNkNcMxmUy0gUA5kwucd6Kcb4jP8oexPEmpVa5Hz Re5PDFScaEIAL2Dw9bRMvdJ5ExJbh9LMhJbJE= DomainKey-Signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; b=bhwL8cLSF83ypHd2nlg2IU+Hql1WfweKh1bbBg4pXO9HYyoHEqzfSLIE3pZFXWPv15 D7mp7kismxObDMUtELbhnux137f9Dm5m/3WjqavkqZFHQSYEvrxiKatXAgEl2lxJE1Yg Zl9ztYjNqKBXI17t8E00/V2ibRv4qyV0ohAw4= MIME-Version: 1.0 Received: by 10.150.134.18 with SMTP id h18mr6807457ybd.107.1242970427855; Thu, 21 May 2009 22:33:47 -0700 (PDT) Date: Thu, 21 May 2009 22:33:47 -0700 Message-ID: <913b460b0905212233g42b003fft89efcc1c8d3e7d4b@mail.gmail.com> Subject: Reminder: Deadline for Special Issue of IMLA approaching (31st May 2009) From: Valeria de Paiva To: types@cis.upenn.edu, rewriting@ens-lyon.fr, kgs@logic.tuwien.ac.at, qed@mcs.anl.gov, caml-list@yquem.inria.fr, categories@mta.ca, ccl@ps.uni-sb.de, comlab@comlab.ox.ac.uk, complog@cs.nmsu.edu, compulognet-parimp@dia.fi.upm.es, coq-club@pauillac.inria.fr, facs@lboro.ac.uk, formal-methods@cs.uidaho.edu, info-hol@cs.uidaho.edu, isabelle-users@cl.cam.ac.uk, Logica-l@dimap.ufrn.br Content-Type: multipart/alternative; boundary=000e0cd3f7d0d195e3046a799a2b X-Spam: no; 0.00; logics:01 logics:01 nanevski:01 abstraction:01 lics:01 lics:01 moggi:01 linguistics:01 monads:01 monads:01 higher-order:01 syntax:01 categorical:01 kripke:01 nanevski:01 --000e0cd3f7d0d195e3046a799a2b Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Dear colleagues, The deadline for the submission of papers to the special issue of Information and Computation on Intuitionistic Modal Logics and Applications is fast approaching (31st May). Please see the CFP below, and forward it to other interested colleagues. If you'd like to submit a paper, but don't think you can make the deadline, please write to us with your title and preliminary abstract and we can have (some!) flexibility. Best regards, Brigitte & Valeria ------------------------------------------------------------------------ Call for Papers Special Issue of Information and Computation on Intuitionistic Modal Logics and Applications (IMLA) Guest Editors: Valeria de Paiva, Brigitte Pientka and Aleks Nanevski Submission deadline: 31. May, 2009 Constructive modal logics and type theories are of increasing foundational and practical relevance in computer science. Applications are in type disciplines for programming languages, and meta-logics for reasoning about a variety of computational phenomena. Theoretical and methodological issues center around the question of how the proof-theoretic strengths of constructive logics can best be combined with the model-theoretic strengths of modal logics. Practical issues center around the question of which modal connectives with associated laws or proof rules capture computational phenomena accurately and at the right level of abstraction and how to implement these efficiently. There have been a series of LICS-affiliated workshops devoted to the theme. The first one was held as part of FLoC1999, Trento, Italy, the second was part of FLoC2002, Copenhagen, Denmark, the third was associated with LiCS2005, Chicago, USA and the last one was associated with LICS 2008 in Pittsburgh, PA, USA. Two special issues of journals on the theme have already appeared, a Mathematical Structures in Computer Science volume edited by Matt Fairtlough, Michael Mendler and Eugenio Moggi (Modalities in type theory) in 2001, and a special issue of the Journal of Logic and Computation in 2004 (Intuitionistic Modal Logics and Application, eds. Valeria de Paiva, R. Gore ad M. Mendler). We are hereby soliciting papers for a further special volume of Information and Computation, devoted to Intuitionistic Modal Logics and Applications. We hope to cover the novel applications presented in the last two workshops, especially applications to computer security, automated deduction and computational linguistics, but also to include work not presented at the workshops. The proposed timeline of events is as follows: * Papers (preferably under 20 pages long) should be submitted by 31st May 2009 * Reviews will be provided until the end of August 2009 and the volume should be ready by the end of the Fall. Topics of interest include, but are not limited to: * applications of intuitionistic necessity and possibility * monads and strong monads * constructive belief logics and type theories * applications of constructive modal logic and modal type theory to formal verification, foundations of security, abstract interpretation, and program analysis and optimization * modal types for integration of inductive and co-inductive types, higher-order abstract syntax, strong functional programming * models of constructive modal logics such as algebraic, categorical, Kripke, topological, and realizability interpretations * notions of proof for constructive modal logics * extraction of constraints or programs from modal proofs * proof search methods for constructive modal logics and their implementations. Please contact one of the editors (Valeria de Paiva valeria@cuill.com or Brigitte Pientka bpientka@cs.mcgill.ca) if you're not sure that your paper is within the scope of this special volume. Submissions should be 10 to 20 pages long and sent in PostScript or PDF format to one of the editors, before the 31st May 2009. --000e0cd3f7d0d195e3046a799a2b Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Dear colleagues,

The deadline for the submission of papers to the sp= ecial issue of
Information and Computation on Intuitionistic Modal Logics and
Applications is fast approaching (31st May).=A0

Please see the CFP = below, and forward it to other interested colleagues. If you'd like to = submit a paper, but don't think you can make the deadline, please write= to us with your title and preliminary abstract and we can have (some!)=A0 = flexibility.


=A0Best regards,
=A0Brigitte & Valeria

------------------------------
----------------------------------------= --

Call for Papers

Special Issue of Information and Computation on
Intuitionistic Modal Logics and Applications (IMLA)

Guest Editors: Valeria de Paiva, Brigitte =A0Pientka and Aleks Nanevski

Submission deadline: 31. May, 2009

Constructive modal logics and type theories are of increasing
foundational and practical relevance in computer science. Applications are = in type disciplines for programming languages, and meta-logics for reasonin= g about a variety of computational phenomena.
Theoretical and methodological issues center around the question of how the= proof-theoretic strengths of constructive logics can best be combined with= the model-theoretic strengths of modal logics. Practical issues center aro= und the question of which modal connectives with associated laws or proof r= ules capture computational phenomena accurately and at the right level of a= bstraction and how to implement these efficiently.

There have been a series of =A0 LICS-affiliated workshops devoted to the th= eme. The first one was held as part of FLoC1999, Trento, Italy, the second = was part =A0of FLoC2002, Copenhagen, Denmark, the third was associated with= LiCS2005, Chicago, USA and the last one was associated with LICS 2008 in P= ittsburgh, PA, USA. Two special issues of journals on the theme have alread= y appeared, =A0a Mathematical Structures in Computer Science volume edited = by Matt Fairtlough, Michael Mendler and Eugenio Moggi (Modalities in type t= heory) in 2001, and a special
issue of =A0the Journal of Logic and Computation =A0in 2004
(Intuitionistic Modal Logics and Application, eds. Valeria de Paiva, R. Gor= e ad M. Mendler).

We are hereby soliciting papers for a further special volume
=A0of Information and Computation, devoted to Intuitionistic Modal
Logics and Applications. We hope to cover the novel applications
presented in the last two workshops, especially applications to
computer security, automated deduction and =A0computational linguistics, bu= t also to include work not presented at the workshops. The proposed timelin= e =A0of events is as follows:
* Papers (preferably under 20 pages long) should be submitted by 31st May = =A02009
* Reviews will be provided until the end of August 2009 and the volume shou= ld be ready by the end of the Fall.

Topics =A0of interest include, but are not limited to:

* applications of intuitionistic necessity and possibility
* monads and strong monads
* constructive belief logics and type theories
* applications of constructive modal logic and modal type theory to formal = verification, foundations of security, abstract interpretation, and program= analysis and optimization
* modal types for integration of inductive and co-inductive types,
higher-order abstract syntax, strong functional programming
* models of constructive modal logics such as algebraic, categorical, Kripk= e, topological, and realizability interpretations
* notions of proof for constructive modal logics
* extraction of constraints or programs from modal proofs
* proof search methods for constructive modal logics and their implementati= ons.

Please contact one of the editors (Valeria de Paiva
valeria@cuill.com or =A0Brigitte Pientka bpientka@cs.mcgill.ca) if
you're not sure that your paper is within the scope of this special
volume. Submissions should be 10 to 20 =A0pages =A0long and sent in
PostScript or PDF format to one of the editors, before the 31st
May 2009.

--000e0cd3f7d0d195e3046a799a2b--