From mboxrd@z Thu Jan 1 00:00:00 1970 X-Sympa-To: caml-list@inria.fr Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105]) by walapai.inria.fr (8.13.6/8.13.6) with ESMTP id q2210PIU032328 for ; Fri, 2 Mar 2012 02:00:26 +0100 X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AkwDAEwbUE+BCnQze2dsb2JhbABDMLNxIgEBFiYFIoF2CSJLClYES4V7gj4Ln0aWfYEfigGCLwoBDQECCAgFDicDCRmFFjgRCx6CTGMEiE+ffIE2 X-IronPort-AV: E=Sophos;i="4.73,514,1325458800"; d="scan'208,217";a="133938134" Received: from amber.ccs.neu.edu ([129.10.116.51]) by mail4-smtp-sop.national.inria.fr with ESMTP/TLS/AES256-SHA; 02 Mar 2012 02:00:25 +0100 Received: from zimbra.ccs.neu.edu ([129.10.116.59]) by amber.ccs.neu.edu with esmtp (Exim 4.69) (envelope-from ) id 1S3Gr8-0003wX-Ug for caml-list@yquem.inria.fr; Thu, 01 Mar 2012 20:00:23 -0500 Received: from localhost (localhost [127.0.0.1]) by zimbra.ccs.neu.edu (Postfix) with ESMTP id E5E81F64001 for ; Thu, 1 Mar 2012 20:00:22 -0500 (EST) 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 klkahEIgM1CX for ; Thu, 1 Mar 2012 20:00:14 -0500 (EST) Received: from sedona.home (pool-74-97-185-158.prvdri.fios.verizon.net [74.97.185.158]) by zimbra.ccs.neu.edu (Postfix) with ESMTP id 6D730F5C003 for ; Thu, 1 Mar 2012 20:00:14 -0500 (EST) From: Amal Ahmed Content-Type: multipart/alternative; boundary="Apple-Mail=_72EB3996-2A61-4F23-B442-D362A6532ED1" Date: Thu, 1 Mar 2012 20:00:26 -0500 Message-Id: <796B5F4A-E5C6-4A2A-B80A-265E7A25CFEB@ccs.neu.edu> To: caml-list@yquem.inria.fr Mime-Version: 1.0 (Apple Message framework v1257) X-Mailer: Apple Mail (2.1257) X-Validation-by: amal@ccs.neu.edu Subject: [Caml-list] LOLA 2012 -- call for contributed talks --Apple-Mail=_72EB3996-2A61-4F23-B442-D362A6532ED1 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset=us-ascii ============================================================ *** CALL FOR CONTRIBUTED TALKS *** 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 ============================================================ IMPORTANT DATES Submission deadline Friday 13th April 2012 Author notification Monday 30th April 2012 Workshop Sunday 24th June 2012 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2012 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 many aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: Typed assembly languages, Certified assembly programming, Certified and certifying compilation, Proof-carrying code, Program optimization, Modal logic and realizability in machine code, Realizability and double orthogonality in assembly code, Parametricity, modules and existential types, General references, Kripke models and recursive types, Continuations and concurrency, Implicit complexity, sublinear programming and Turing machines, Closures and explicit substitutions, Linear logic and separation logic, Game semantics, abstract machines and hardware synthesis, Monoidal and premonoidal categories, traces and effects. SUBMISSION INFORMATION: LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. PROGRAM CO-CHAIRS: Amal Ahmed (Northeastern University) Aleksandar Nanevski (IMDEA Software) PROGRAM COMMITTEE: 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) Sungwoo Park (Pohang University of Science and Technology) Dusko Pavlovic (Royal Holloway, University of London) Andreas Rossberg (Google) --Apple-Mail=_72EB3996-2A61-4F23-B442-D362A6532ED1 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

   = ;      *** CALL FOR CONTRIBUTED TALKS ***
=
=
            = ;        LOLA 2012

 &nb= sp;  Syntax and Semantics of Low Level Languages


 &nb= sp;   Sunday 24th June 2012, Dubrovnik, Croatia

 = ;         A LICS 2012-affiliat= ed workshop 
     http://www.ccs.neu.edu/home/amal/lola2012= =

=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

IMPORTANT DATES

Submi= ssion deadline     Friday  13th  April 2012&n= bsp;
Author notification     Monday  30th  = ;April 2012
Workshop         &nb= sp;      Sunday  24th  June  2= 012
SUBMISSION LINK

The submissions will be made by easychair= ath= ttps://www.easychair.org/conferences/?conf=3Dlola2012

DESCRIPTIO= N OF THE WORKSHOP


It has been understood since the late 1960s that t= ools and structures
arising in mathematical logic and proof theory can u= sefully be applied
to the design of high level programming languages, an= d to the
development of reasoning principles for such languages. Yet low= level
languages, such as machine code, and the compilation of high leve= l
languages into a low level ones have traditionally been seen as having= =
little or no essential connection to logic.

However, a fundame= ntal discovery of this past decade has been that low
level languages ar= e also governed by logical principles. From this key
observation has em= erged an active and fascinating new research area at
the frontier of lo= gic and computer science. The practically-motivated
design of logics r= eflecting the structure of low level languages (such
as heaps, register= s and code pointers) and low level properties of
programs (such as resou= rce usage) goes hand in hand with the some of
the most advanced contempo= rary researches in semantics and proof
theory, including classical reali= zability and forcing, double
orthogonality, parametricity, linear logi= c, game semantics,
uniformity, categorical semantics, explicit substitut= ions, abstract
machines, implicit complexity and sublinear programming.<= /span><= br>The LOLA workshop, affiliated with LICS, will bring together<= span class=3D"Apple-style-span" style=3D"font-family: monospace; ">
rese= archers interested in many aspects of the relationship between
logic and= low level languages and programs. Topics of interest

include, but are n= ot limited to:

Typed assembly languages,
Certified assembly progr= amming,
Certified and certifying compilation,
Proof-carrying code,
Program optimization,
Modal logic and realizability in machine code,
Realizability and double orthogonality in assembly code,
Parametricity,= modules and existential types,
General references, Kripke models and re= cursive types,
Continuations and concurrency, 
Implicit complexi= ty, sublinear programming and Turing machines,
Closures and explicit sub= stitutions,
Linear logic and separation logic,
Game semantics, abstra= ct machines and hardware synthesis,
Monoidal and premonoidal categories,= traces and effects.

SUBMISSION INFORMATION: 

<= span class=3D"Apple-style-span" style=3D"font-family: monospace; ">LOLA is = an informal workshop aiming at a high degree of useful
interaction among= st the participants, welcoming proposals for talks on
work in progress, = overviews of larger programmes, position
presentations and short tutoria= ls as well as more traditional research
talks describing new results.

The programme committee will select the workshop presentations fromsubmitted proposals, which may take the form either of a short
<= span class=3D"Apple-style-span" style=3D"font-family: monospace; ">abstract= or of a longer (published or unpublished) paper describing
completed wo= rk.

PROGRAM CO-CHAIRS:

Amal Ahmed     = ;     (Northeastern University)  
<= span class=3D"Apple-style-span" style=3D"font-family: monospace; ">Aleksand= ar Nanevski (IMDEA Software)

PROGRAM COMMITTEE: 
<= span class=3D"Apple-style-span" style=3D"font-family: monospace; ">
Cris= tiano Calcagno  (Imperial College London and Monoidics Limited)=
Rob= ert Dockins      (Princeton University)
= Martin = Hofmann      (LMU Munich)
Xavier Leroy  &n= bsp;     (INRIA Rocquencourt)
Andrzej Murawski =    (University of Leicester)
Sungwoo Park   &nb= sp;    (Pohang University of Science and Technology)Dusko Pavlovic      (Royal Holloway, University o= f London)
Andreas Rossberg    (Google)
= --Apple-Mail=_72EB3996-2A61-4F23-B442-D362A6532ED1--