From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: 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 E91F27ED26 for ; Mon, 28 May 2012 17:25:43 +0200 (CEST) X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: ApYJAMGXw0+BCnQze2dsb2JhbABFMLUvIgEBFiYFIoIZIlVWBEuIPguXGJdWiQSLAxQEhEdgA5YmkV6BOg X-IronPort-AV: E=Sophos;i="4.75,671,1330902000"; d="scan'208,217";a="160262885" Received: from amber.ccs.neu.edu ([129.10.116.51]) by mail1-smtp-roc.national.inria.fr with ESMTP/TLS/AES256-SHA; 28 May 2012 17:25:42 +0200 Received: from zimbra.ccs.neu.edu ([129.10.116.59]) by amber.ccs.neu.edu with esmtp (Exim 4.69) (envelope-from ) id 1SZ1pG-0008Gd-1p for caml-list@yquem.inria.fr; Mon, 28 May 2012 11:25:42 -0400 Received: from localhost (localhost [127.0.0.1]) by zimbra.ccs.neu.edu (Postfix) with ESMTP id 03903FD404D for ; Mon, 28 May 2012 11:25:42 -0400 (EDT) X-Virus-Scanned: amavisd-new at zimbra.ccs.neu.edu Received: from zimbra.ccs.neu.edu ([127.0.0.1]) by localhost (zimbra.ccs.neu.edu [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id f-kwN7hsSEdg for ; Mon, 28 May 2012 11:25:36 -0400 (EDT) Received: from sedona.home (pool-108-34-227-152.prvdri.fios.verizon.net [108.34.227.152]) by zimbra.ccs.neu.edu (Postfix) with ESMTP id 39154F64002 for ; Mon, 28 May 2012 11:25:36 -0400 (EDT) From: Amal Ahmed Content-Type: multipart/alternative; boundary="Apple-Mail=_896161D0-3A49-4EF5-8573-39C00D803ECC" Date: Mon, 28 May 2012 11:25:36 -0400 Message-Id: <012312CE-94E2-4A86-B47A-5A2D26491783@ccs.neu.edu> To: caml-list@yquem.inria.fr Mime-Version: 1.0 (Apple Message framework v1278) X-Mailer: Apple Mail (2.1278) X-Validation-by: amal@ccs.neu.edu Subject: [Caml-list] LOLA 2012: Call for Participation (early registration by May 31) --Apple-Mail=_896161D0-3A49-4EF5-8573-39C00D803ECC Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset=us-ascii ============================================================ *** CALL FOR PARTICIPATION *** LOLA 2012 Syntax and Semantics of Low Level Languages Sunday 24th June 2012, Dubrovnik, Croatia A LICS 2012-affiliated workshop http://www.ccs.neu.edu/home/amal/lola2012/ ============================================================ *** Early Registration DEADLINE: 31 May 2012 *** Registration, accomodation, and travel information for LICS and all affiliated workshops is on the LICS 2012 web page: http://www2.informatik.hu-berlin.de/lics/lics12/ INVITED TALKS: * Jade Alglave (University of Oxford). * Ulrich Schoepp (LMU Munich). CONTRIBUTED TALKS: * Nikos Tzevelekos and Andrzej Murawski. Algorithmic Games for Full Ground References * Jacob Thamsborg, Lars Birkedal, Guilhem Jaber, and Filip Sieczkowski. Kripke Logical Relations for Region Polymorphism * Tadeusz Litak. Extending Nakano-style Type Systems and Logics * Nick Benton, Andrew Kennedy, and Jonas Jensen. Using Coq to Generate and Reason About x86 Systems Code * Ruy Ley-Wild and Aleksandar Nanevski. Subjective Concurrent Separation Logic * Paul-Andre Mellies. Strong Monads and Enriched Adjunctions DESCRIPTION OF THE WORKSHOP: It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants. PROGRAMME COMMITTEE: * Amal Ahmed (Northeastern University, co-chair) * Cristiano Calcagno (Imperial College London and Monoidics Limited) * Robert Dockins (Princeton University) * Martin Hofmann (LMU Munich) * Xavier Leroy (INRIA Rocquencourt) * Andrzej Murawski (University of Leicester) * Aleksandar Nanevski (IMDEA Software, co-chair) * Sungwoo Park (Pohang University of Science and Technology) * Dusko Pavlovic (Royal Holloway, University of London) * Andreas Rossberg (Google) --Apple-Mail=_896161D0-3A49-4EF5-8573-39C00D803ECC Content-Transfer-Encoding: quoted-printable Content-Type: text/html; charset=us-ascii

=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

         &= nbsp;    *** CALL FOR PARTICIPATION ***

<= span class=3D"Apple-style-span" style=3D"font-family: monospace; "> &n= bsp;            = ;          LOLA  201= 2

       Syntax and Semantics of = Low Level Languages

       Sunday= 24th June 2012, Dubrovnik, Croatia

     &n= bsp;       A LICS 2012-affiliated worksh= op
        http://www.ccs.neu.edu/home/amal/lola= 2012/

=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


*** Early Regi= stration DEADLINE: 31 May 2012 ***


Registration, accomodation, a= nd travel information for LICS and all
affiliated  workshops is on = the LICS 2012 web page:  

  http://www2.informatik.hu-berlin.de/lic= s/lics12/


INVITED TALKS:

* Jade Alglave (University o= f Oxford). 

* Ulrich Schoepp (LMU Munich). 

=
CON= TRIBUTED TALKS:

* Nikos Tzevelekos and Andrzej Murawski.  Algor= ithmic Games for Full
  Ground References

* Jacob Thams= borg, Lars Birkedal, Guilhem Jaber, and Filip
  Sieczkowski. &= nbsp;Kripke Logical Relations for Region Polymorphism

* Tadeusz Lita= k.  Extending Nakano-style Type Systems and Logics

* Nick Ben= ton, Andrew Kennedy, and Jonas Jensen.  Using Coq to
  Ge= nerate and Reason About x86 Systems Code

* Ruy Ley-Wild and Aleksand= ar Nanevski.  Subjective Concurrent
  Separation Logic&nb= sp;
* Paul-Andre Mellies.  Strong Monads and Enriched Adjunctio= ns

DESCRIPTION OF THE WORKSHOP:

It has been understood si= nce the late 1960s that tools and structures
arising in mathematical log= ic and proof theory can usefully be applied
to the design of high level = programming languages, and to the
development of reasoning principles fo= r such languages. Yet low level
languages, such as machine code, and the= compilation of high level
languages into a low level ones have traditio= nally been seen as having
little or no essential connection to logic.However, a fundamental discovery of this past decade has been that lo= w
level languages are also governed by logical principles. From this key= =
observation has emerged an active and fascinating new research area at<= /span><= br>design of logics reflecting the structure of low level languages (such
= = as heaps, registers and code pointers) and low level properties of
progr= ams (such as resource usage) goes hand in hand with the some of
<= span class=3D"Apple-style-span" style=3D"font-family: monospace; ">the most= advanced contemporary researches in semantics and proof
theory, includ= ing classical realizability and forcing, double
orthogonality, parametri= city, linear logic, game semantics,
uniformity, categorical semantics, e= xplicit substitutions, abstract
machines, implicit complexity and sublin= ear programming.

The LOLA workshop, affiliated with LICS, will bring= together
researchers interested in the various aspects of the relations= hipbetween logic and low level languages and programs. LOLA is an
in= formal workshop aiming at a high degree of useful interaction
amongst th= e participants.

PROGRAMME COMMITTEE:

 * Amal Ahmed (Nort= heastern University, co-chair)
 * Cristiano Calcagno (Imperial Coll= ege London and Monoidics Limited)
 * Robert Dockins (Princeton Univ= ersity) 
 * Martin Hofmann (LMU Munich) 
 * Xavie= r Leroy (INRIA Rocquencourt)
 * Andrzej Murawski (University of L= eicester)
 * Aleksandar Nanevski (IMDEA Software, co-chair)<= span class=3D"Apple-style-span" style=3D"font-family: monospace; ">
&nbs= p;* Sungwoo Park (Pohang University of Science and Technology) =
&nb= sp;* Dusko Pavlovic (Royal Holloway, University of London) 
=  *= Andreas Rossberg (Google)= --Apple-Mail=_896161D0-3A49-4EF5-8573-39C00D803ECC--