3rd Joint Workshop Linearity & TLLA

Seventh International Workshop on Linearity

Sixth International Workshop on Trends in Linear Logic and Applications

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. We also hope to enable newcomers to learn about current activities in this area. 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 practices.

Submission Guidelines

Authors are invited to submit:

• Extended abstract (8 pages max) describing original ideas and results not published nor submitted elsewhere; or
• Abstract (5 pages max) presenting relevant work that has been or will be published elsewhere; or
• Description (2 pages max) of work in progress.

Papers should be written in English, and submitted in PDF format using the EPTCS style files.

Preliminary proceedings will be available at the workshop.

List of Topics

• theory of programming languages
• type systems - verification
• models of computation:
  • categorical models
  • quantum and probabilistic models 
  • biological and chemical models
• games and languages
• proof theory
• parallelism and concurrency
• linear logic methods in computer science
• implicit computational complexity
• sub-linear logics
• interaction-based systems
• categories and algebra
• connections with combinatorics
• functional analysis and operator algebras
• logic and philosophy
• linguistics

Committees

Program Committee

• Maribel Fernandez - King's College London, UK
• Marie Kerjean - CNRS-University Sorbonne Paris Nord, France 
• Ugo Dal Lago - University of Bologna, Italy 
• Marina Lenisa - University of Udine, Italy 
• Guy McCusker - University of Bath, UK 
• Lê Thành Dũng Nguyễn - University of Rennes, France   
• Valeria de Paiva - Topos Institute, USA 
• Laurent Regnier - University of Aix-Marseille, France 
• Lorenzo Tortora de Falco - University Roma Tre, Italy 
• Andrés Viso - Inria, France 
• Daniel Ventura - Federal University of Goiás, Brazil 

Organizing committee

• Sandra Alves - University of Porto, Portugal
• Thomas Ehrhard - IRIF, University of Paris, France
• Stefano Guerrini - LIPN, University Sorbone Paris Nord, France
• Lorenzo Tortora de Falco - University Roma Tre, Italy
• Daniel Ventura (co-chair) - Federal University of Goiás, Brazil

Post-Proceedings

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