8:50 - 9:00
9:00 - 10:00

The Next 700 Network Programming Languages
Nate Foster - invited speaker.
10:00 - 10:30
Coffee Break
10:30 - 12:00

No value restriction is needed for algebraic effects and handlers,
Ohad Kammar, Sean Moss and Matija Pretnar.
Alpha is for Address,
Arthur Azevedo de Amorim and Benjamin Pierce.
Learning Cost Semantics for Modeling Running Time of OCaml Programs,
Ankush Das and Jan Hoffmann.
12:00 - 13:30
13:30 - 14:30

Rust for Semanticists
Alan Jeffrey - invited speaker.
14:30 - 15:30

SyTeCi: Symbolic, Temporal and Circular reasoning for automatic proofs of contextual equivalence
Guilhem Jaber - invited speaker.
15:30 - 16:00
Coffee Break
16:00 - 17:30

Token Machines for Multiport Interaction Combinators,
Ugo Dal Lago, Ryo Tanaka and Akira Yoshimizu.
On Time and Space in Higher Order Boolean Circuits,
Damiano Mazza.
Kripke semantics for full ground references (work in progress),
Paul Blain Levy.


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 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.


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 May 24, 2016. Abstracts must be written in English and be submitted as a single PDF file at EasyChair page for LOLA.

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.

Specific topics of interest for the workshop include (but are not limited to):

Call for Papers: txt

Invited Speakers

Important Dates

Abstract Submission
May 24, 2016
June 02, 2016
Deadline early registration LICS
June 03, 2016
July 10, 2016

Submission website

EasyChair page for LOLA

Program Committee