3rd International Workshop on Linearity

With the urge for more robust, verifiable and optimised programming languages, the interest for linearity in order to have more control on computational resources is increasing in several areas of Computer Science, both in the theoretical side: with work on proof technology, complexity classes and more recently quantum computation, and in the practical side: work on program analysis, expressive operational semantics, linear languages, and techniques for program transformation, update analysis and efficient implementation. The topics of interest include 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. Topics of interest include, but are not limited to: sub-linear logics linear term calculi linear type systems linear proof-theory linear programming languages applications to concurrency interaction-based systems verification of linear systems quantum models of computation biological and chemical models of computation