The program is here.

Slides from talks:
Marcelo Fiore, Algebraic theories and control effects, back and forth
Gergö Barany, A more precise, more correct stack and register model for CompCert
Yannick Forster, Towards a library of formalised undecidable problems in Coq: The undecidability of intuitionistic linear logic
Koko Muroya, A graph-rewriting perspective of the beta-law
Simon Castellan, Denotational even structure for relaxed memory
Guillaume Munch-Maccagnoni, A resource modality for RAII
Paul Blain Levy, Heaps denote finitely partitioned forests


Since the late 1960s it has been known 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 low-level ones have traditionally been seen as having little or no essential connection to logic.

However, a fundamental discovery of the past two decades 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 some of the most advanced contemporary research 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 resource bounded programming.

The LOLA workshop, affiliated with LICS at FLoC 2018, will bring together researchers interested in the relationships and connections between logic and low-level languages and programs. Topics of interest include, but are not limited to:


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 two page abstract (excluding references, appendices, and/or acknowledgements) or of a longer (published or unpublished) paper describing completed work.

Authors are invited to submit their contribution by April 19, 2018. Abstracts must be written in English and be submitted as a single PDF file at EasyChair.

Submissions will undergo a lightweight review process and will be judged on originality, relevance, interest and clarity. Submission should describe novel works or works that have already appeared elsewhere but that can stimulate the discussion between different communities at the workshop.

At least one author of an accepted workshop paper must be registered for the workshop.

The workshop will not have formal proceedings and is not intended to preclude later publication at another venue.

Previous editions

Important Dates

Abstract Submission
Thursday, 19 April 2018
Author Notification
Sunday, 13 May 2018
Early Registration Deadline
Wednesday, 6 June 2018
Saturday, 7 July 2018

Invited Speakers

Submission website

Program Committee