Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications
Thomas Ehrhard, Maribel Fern\'andez, Valeria de Paiva, Lorenzo Tortora, de Falco

TL;DR
This collection of papers from the 2018 Linearity/TLLA workshops explores advances in linear logic's theoretical foundations and practical applications in computer science, including quantum computation and program analysis.
Contribution
The volume showcases recent research integrating linear logic with computational complexity, quantum computing, and programming language semantics, highlighting new methodologies and tools.
Findings
Advances in proof technology and complexity analysis using linear logic.
Application of linear logic tools in quantum computation and program analysis.
Development of new semantic models and implementation techniques for linear logic.
Abstract
This volume contains a selection of papers presented at Linearity/TLLA 2018: Joint Linearity and TLLA workshops (part of FLOC 2018) held on July 7-8, 2018 in Oxford. 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
