Note: all talks are in room M1.05 of Reykjavik University
9:00–10:00 Małgorzata Biernacka
Invited talk: From reduction semantics to abstract machines with refocusing
coffee break (30min)
10:30–11:15 Tarmo Uustalu
Interaction morphisms and Turing computation
11:15–12:00 Yannick Forster, Fabian Kunze and Marc Roth
The strong invariance thesis for a lambda-calculus
lunch (1h 35min)
13:35–14:20 James Laird
Linear types and Resources for the Solos Calculus
14:35–15:20 Pierre-Marie Pédrot
A Parametric CPS to Sprinkle CIC with Classical Reasoning
coffee break (30min)
15:50–16:35 Jean-Yves Moyen, Thomas Rubiano and Thomas Seiller
Loop Quasi-Invariant Chunk Motion by peeling with statement composition
16:35–17:05 Paul Blain Levy
Stateful values as finitely supported paths
17:05–18:05 Damien Pous
Invited talk: Automating program equivalence proofs using Kleene algebra


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 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 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 2017, 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 or of a longer (published or unpublished) paper describing completed work.

Authors are invited to submit their contribution by April 19, 2017. 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.

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

Call for Papers: txt

Previous editions

Important Dates

Abstract Submission
Wednesday, 19 April 2017
Author Notification
Monday, 1 May 2017
Monday, 19 June 2017

Invited Speakers

Submission website

Program Committee