Call for Papers

                      Joint   Linearity & TLLA  Workshop

            Fifth International Workshop on Linearity
   Second International Workshop on Trends in Linear Logic and Applications

                         Oxford, UK, 7-8 July 2018

                      Affiliated with FSCD 2018 in FLOC


Linearity has been a key feature in several lines of research in both
theoretical and practical approaches to computer science. On the
theoretical side there is much work stemming from linear logic dealing
with proof technology, complexity classes and more recently quantum
computation. On the practical side there is work on program analysis,
expressive operational semantics for programming languages, linear
programming languages, program transformation, update analysis and
efficient implementation techniques.

Linear logic is not only a theoretical tool to analyse the use of
resources in logic and computation. It is also a corpus of tools,
approaches, and methodologies (proof nets, exponential decomposition,
geometry of interaction, coherent spaces, relational models, etc.) that
were originally developed for the study of linear logic's syntax and
semantics and are nowadays applied in several other fields.

The aim of this Joint Linearity and TLLA workshop is to bring together
researchers who are currently working on linear logic and related fields,
to foster their interaction and provide a forum for presenting new ideas
and work in progress, and to enable newcomers to learn about current
activities in this area.
The main goal is to present and discuss new trends in Linear Logic and
its applications, by means of tutorials, invited talks, open discussions,
and contributed talks. New results that make central use of linearity,
ranging from foundational work to applications in any field, are welcome.
Also welcome are more exploratory presentations, which may examine open
questions and raise fundamental concerns about existing theories and

Topics of interest include:
- theory of programming languages
- type systems
- verification
- models of computation
- implicit computational complexity
- parallelism and concurrency
- games and languages
- proof theory
- philosophy
- categories and algebra
- connections with combinatorics
- linguistics
- functional analysis and operator algebras

Important Dates

Submission deadline:             1 May 2018
Notification to authors:        15 May   2018
Final versions due:             24 May   2018
Workshop date:                  7-8 July 2018


Authors are invited to submit:
* an extended abstract (8 pages max) describing original ideas and results
not published nor submitted elsewhere,
* or a 5-page abstract presenting relevant work that has been or will be
published elsewhere,
* or a 2-page description of work in progress.
Preliminary proceedings will be available at the workshop.
Papers should be written in English, and submitted in PDF format using the
EPTCS style files.
Submission is through the Easychair website:


After the workshop, authors of  extended abstracts will be invited to submit
a longer version of their work (typically a 15-pages paper) for publication
in EPTCS (TBC). These submissions will undergo a second round of

Programme Committee

Vito Michele Abrusci
Thomas Ehrhard (co-chair)
Maribel Fernandez (co-chair)
Stefano Guerrini
Masahito Hasegawa
Olivier Laurent
Paul-Andre Mellies
Valeria de Paiva (co-chair)
Elaine Pimentel
Simona Ronchi della Rocca
Christine Tasson
Lorenzo Tortora de Falco (co-chair)


Thomas Ehrhard            thomas.ehrh...@irif.fr
Valeria de Paiva          valeria.depa...@gmail.com
Maribel Fernandez         maribel.fernan...@kcl.ac.uk
Lorenzo Tortora de Falco  tort...@uniroma3.it

Valeria de Paiva

Você está recebendo esta mensagem porque se inscreveu no grupo "LOGICA-L" dos 
Grupos do Google.
Para cancelar inscrição nesse grupo e parar de receber e-mails dele, envie um 
e-mail para logica-l+unsubscr...@dimap.ufrn.br.
Para postar neste grupo, envie um e-mail para logica-l@dimap.ufrn.br.
Visite este grupo em https://groups.google.com/a/dimap.ufrn.br/group/logica-l/.
Para ver esta discussão na web, acesse 

Responder a