From mboxrd@z Thu Jan 1 00:00:00 1970 Received: from mail1-relais-roc.national.inria.fr (mail1-relais-roc.national.inria.fr [192.134.164.82]) by walapai.inria.fr (8.13.6/8.13.6) with ESMTP id q3EKEPdd013151 for ; Sat, 14 Apr 2012 22:14:25 +0200 X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AvMHAEXaiU+BCnQze2dsb2JhbABEMIJssW8iAQEWJgUiggsiSwpaiQwLl0eXQokJizKFNGMEm1+NRoE4 X-IronPort-AV: E=Sophos;i="4.75,423,1330902000"; d="scan'208,217";a="154111992" Received: from amber.ccs.neu.edu ([129.10.116.51]) by mail1-smtp-roc.national.inria.fr with ESMTP/TLS/AES256-SHA; 14 Apr 2012 22:14:19 +0200 Received: from zimbra.ccs.neu.edu ([129.10.116.59]) by amber.ccs.neu.edu with esmtp (Exim 4.69) (envelope-from ) id 1SJ9MP-0003pK-Pb for caml-list@yquem.inria.fr; Sat, 14 Apr 2012 16:14:17 -0400 Received: from localhost (localhost [127.0.0.1]) by zimbra.ccs.neu.edu (Postfix) with ESMTP id B6CD6F5C00B for ; Sat, 14 Apr 2012 16:14:17 -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 PXH9PVM1S0CH for ; Sat, 14 Apr 2012 16:14:09 -0400 (EDT) Received: from [10.10.1.141] (wsip-70-164-246-115.ri.ri.cox.net [70.164.246.115]) by zimbra.ccs.neu.edu (Postfix) with ESMTP id E5E9EF5C003 for ; Sat, 14 Apr 2012 16:14:04 -0400 (EDT) From: Amal Ahmed Content-Type: multipart/alternative; boundary="Apple-Mail=_70DA1987-9873-4B4C-9A16-77F158588684" Date: Sat, 14 Apr 2012 16:14:14 -0400 Message-Id: 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 Talk Proposals (deadline extended) --Apple-Mail=_70DA1987-9873-4B4C-9A16-77F158588684 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset=us-ascii *** Submission deadline extended to April 19th *** ============================================================ *** 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 Thursday 19th April 2012 (extended) 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=_70DA1987-9873-4B4C-9A16-77F158588684 Content-Transfer-Encoding: quoted-printable Content-Type: text/html; charset=us-ascii

*** Submission deadline extended to April 19th *= **

=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=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 TALK= PROPOSALS ***

         = ;           LOLA 201= 2

    Syntax and Semantics of Low Level Language= s

     Sunday 24th June 2012, Dubrovnik, Cr= oatia

          A = LICS 2012-affiliated workshop 
     http://www.ccs.neu.edu/hom= e/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

Submission deadline     Thursday  19th  Ap= ril 2012  (extended)
Author notification     M= onday    30th  April 2012
Workshop    &nbs= p;           Sunday =    24th  June  2012

SUBMISSION LINK

The s= ubmissions will be made by easychair at
https://www.easychair.org/conferences/?c= onf=3Dlola2012

DESCRIPTION OF THE WORKSHOP

It has been un= derstood since the late 1960s that tools and structures
arising in mat= hematical 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 connectio= n 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 rese= arch area at
the frontier of logic and computer science. The practically= -motivated
design of logics reflecting the structure of low level langua= ges (such
as heaps, registers and code pointers) and low level propertie= s of
programs (such as resource usage) goes hand in hand with the some o= f
the most advanced contemporary researches in semantics and proof
th= eory, including classical realizability and forcing, double
orthogonalit= y, parametricity, linear logic, game semantics,
uniformity, categorical = semantics, explicit substitutions, abstract
machines, implicit complexit= y and sublinear programming.

The LOLA workshop, affiliated with LI= CS, will bring together
researchers interested in many aspects of the re= lationship between
logic and low level languages and programs. Topics of= interest
include, but are not limited to:

Typed assembly languag= es,Certified assembly programming,
Certified and certifying compilat= ion,
Proof-carrying code,
Program optimization,
Modal logic an= d realizability in machine code,
Realizability and double orthogonality = in assembly code,
Parametricity, modules and existential types,
Gener= al references, Kripke models and recursive types,
Continuations and conc= urrency, 
Implicit complexity, sublinear programming and Turing mac= hines,
Closures and explicit substitutions,
Linear logic and separati= on logic,
Game semantics, abstract machines and hardware synthesis,
<= /span>M= onoidal and premonoidal categories, traces and effects.

SUBMISSION= INFORMATION: 

LOLA is an informal workshop aiming at a high de= gree 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<= /span><= br>

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 unpublishe= d) paper describing
completed work.


PROGRAM CO-CHAIRS:=
Amal Ahmed          (Northeas= tern University)  
Aleksandar Nanevski (IMDEA Software)
<= span class=3D"Apple-style-span" style=3D"font-family: monospace; ">
PROG= RAM COMMITTEE: 

Cristiano Calcagno  (Imperial College Lo= ndon and Monoidics Limited)
Robert Dockins      = ;(Princeton University)
Martin Hofmann      (LM= U Munich)
Xavier Leroy        (INRIA = Rocquencourt)
Andrzej Murawski    (University of Leiceste= r)Sungwoo Park        (Pohang Univer= sity of Science and Technology)
Dusko Pavlovic     &= nbsp;(Royal Holloway, University of London)
Andreas Rossberg   = ; (Google)
= --Apple-Mail=_70DA1987-9873-4B4C-9A16-77F158588684--