Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
LOLA 2010 -- final call for contributed talks
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2010-04-14 (20:23)
From: Nick Benton <nick@m...>
Subject: LOLA 2010 -- final call for contributed talks


                         LOLA  2010

        Syntax and Semantics of Low Level Languages

            Friday 9th July 2010, Edinburgh, UK

        A LICS 2010-affiliated workshop at FLoC 2010

 **NEW** Invited speakers: Gérard Berry, Alex Simpson
 **NEW** Invited tutorial: Dan Ghica
 **NOTE** Submission deadline is earlier than in first call


Submission deadline     Monday   19th April 2010  ** REVISED (EARLIER) **
Author notification     Saturday 1st  May   2010
Workshop                Friday   9th  July  2010


The submissions will be made by easychair at


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.

Topics of interest include, but are not limited to:

       - Typed assembly languages
       - Certified compilation
       - Proof-carrying code
       - Program optimization
       - Modal logic and realizability in machine code
       - Realizability and double orthogonality in assembly code,
       - Implicit complexity, sublinear programming and Turing machines
       - Parametricity, modules and existential types
       - General references, Kripke models and recursive types
       - Closures and explicit substitutions
       - Linear logic and separation logic
       - Game semantics, abstract machines and hardware synthesis
       - Monoidal and premonoidal categories, traces and effects


 - Gérard Berry (INRIA Sophia) 
   "What could be the right balance between abstract and fine-grain computational properties?"

 - Alex Simpson (LFCS, Edinburgh University) 


 - Dan Ghica (University of Birmingham) 
   Game Semantics and Hardware Synthesis


       * Amal Ahmed (Indiana University)
       * Nick Benton (MSR Cambridge, co-chair)
       * Lars Birkedal (IT University of Copenhagen)
       * Dan Ghica (University of Birmingham)
       * Paul-Andre Mellies (CNRS & University Paris Diderot, co-chair)
       * François Pottier (INRIA Rocquencourt)
       * Ulrich Schoepp (LMU Munich)
       * Hayo Thielecke (University of Birmingham)


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.

The submissions should be made by easychair at