From mboxrd@z Thu Jan 1 00:00:00 1970 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 q3BI9XlZ026912 for ; Wed, 11 Apr 2012 20:09:33 +0200 X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AiMEAPXHhU+BCnQzkWdsb2JhbABEMLkgIgEBAQEJCwsHFAUiggsiSwpaiQwLmVGYSYkJiyWFPmMEqSWBOA X-IronPort-AV: E=Sophos;i="4.75,406,1330902000"; d="scan'208,217";a="139866893" Received: from amber.ccs.neu.edu ([129.10.116.51]) by mail4-smtp-sop.national.inria.fr with ESMTP/TLS/AES256-SHA; 11 Apr 2012 20:09:27 +0200 Received: from zimbra.ccs.neu.edu ([129.10.116.59]) by amber.ccs.neu.edu with esmtp (Exim 4.69) (envelope-from ) id 1SI1yu-00081o-9d for caml-list@yquem.inria.fr; Wed, 11 Apr 2012 14:09:24 -0400 Received: from localhost (localhost [127.0.0.1]) by zimbra.ccs.neu.edu (Postfix) with ESMTP id 3A9EFF5C003 for ; Wed, 11 Apr 2012 14:09:24 -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 DR1QWm9aQ2r1 for ; Wed, 11 Apr 2012 14:09:17 -0400 (EDT) Received: from cola.ccs.neu.edu (syrah.ccs.neu.edu [129.10.110.48]) by zimbra.ccs.neu.edu (Postfix) with ESMTP id 2EA48F5C007 for ; Wed, 11 Apr 2012 14:09:17 -0400 (EDT) From: Amal Ahmed Content-Type: multipart/alternative; boundary="Apple-Mail=_BD2B33E6-9878-4478-A7A1-699A3829E9E4" Date: Wed, 11 Apr 2012 14:09:18 -0400 Message-Id: <822DD439-CCB9-4529-8239-CE28C7B11B05@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: Final Call for Talk Proposals --Apple-Mail=_BD2B33E6-9878-4478-A7A1-699A3829E9E4 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset=us-ascii ============================================================ *** FINAL CALL FOR TALK PROPOSALS *** 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=_BD2B33E6-9878-4478-A7A1-699A3829E9E4 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
        *** FINAL CALL FOR TALK PROPOSALS ***
<= /span><= br>

 &nbs= p;  Syntax and Semantics of Low Level Languages

 &nbs= p;   Sunday 24th June 2012, Dubrovnik, Croatia

 =          A LICS 2012-affiliate= d workshop 
     http://www.ccs.neu.edu/home/amal/lola2012<= /span><= br>=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
Workshop          &nb= sp;     Sunday  24th  June  2012
SUBMISSION LINK

The submissions will be made by easychair at<= /span><= br>https= ://www.easychair.org/conferences/?conf=3Dlola2012

DESCRIPTION OF= THE WORKSHOP

It has been understood since the late 1960s that tools= and structures
arising in mathematical logic and proof theory can usefu= lly be applied
to the design of high level programming languages, and to= the
development of reasoning principles for such languages. Yet low lev= ellanguages, such as machine code, and the compilation of high levellanguages into a low level ones have traditionally been seen as having
= = little or no essential connection to logic.

However, a fundamental d= iscovery 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 c= omputer science. The practically-motivated
design of logics reflecting t= he structure of low level languages (such
as heaps, registers and code p= ointers) and low level properties of
programs (such as resource usage) g= oes hand in hand with the some of
the most advanced contemporary researc= hes in semantics and proof
theory, including classical realizability and= forcing, double
orthogonality, parametricity, linear logic, game semant= ics,
uniformity, categorical semantics, explicit substitutions, abstract= =
machines, implicit complexity and sublinear programming.

= The LOL= A workshop, affiliated with LICS, will bring together
researchers intere= sted in many aspects of the relationship between
logic and low level lan= guages and programs. Topics of interest
include, but are not limited to:= =

Typed assembly languages,
Certified assembly programming,=
Cer= tified and certifying compilation,
Proof-carrying code,
Program optim= ization,
Modal logic and realizability in machine code,
Realizability= and double orthogonality in assembly code,
Parametricity, modules and e= xistential 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 an= d hardware synthesis,
Monoidal and premonoidal categories, traces and ef= fects.

SUBMISSION INFORMATION: 

LOLA is an informal work= shop aiming at a high degree of useful
interaction amongst the participa= nts, welcoming proposals for talks on
work in progress, overviews of lar= ger programmes, position
presentations and short tutorials as well as = more traditional research
talks describing new results.

<= span class=3D"Apple-style-span" style=3D"font-family: monospace; ">The prog= ramme committee will select the workshop presentations from
submitted pr= oposals, which may take the form either of a short
abstract or of a long= er (published or unpublished) paper describing
completed work.



Amal Ahmed      &nbs= p;   (Northeastern University)  
Aleksandar Nanevsk= i (IMDEA Software)

PROGRAM COMMITTEE: 

Cristiano Calcagn= o  (Imperial College London and Monoidics Limited)
Robert Dockins=      (Princeton University)
Martin Hofmann &nb= sp;    (LMU Munich)
Xavier Leroy    &= nbsp;   (INRIA Rocquencourt)
Andrzej Murawski   = ; (University of Leicester)
Sungwoo Park     &n= bsp;  (Pohang University of Science and Technology)
Dusko Pavl= ovic      (Royal Holloway, University of London)