CAUTION: The Sender of this email is not from within Dalhousie. ITRS 2021 Call for papersTenth Workshop on Intersection Types and Related Systems - ITRS 2021 17 July 2021, Online Affiliated with FSCD <https://fscd2021.dc.uba.ar/>, 17-24 July 2021, Buenos Aires Web page: http://www.di.unito.it/~deligu/ITRS2021/ Aims and Scope Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. The key idea is to introduce an intersection type constructor ∧ such that a term of type t ∧ s can be used at both type t and s within the same context. This provides a finite polymorphism where various, even unrelated, types of the term are listed explicitly, differently from the more widely used universally quantified types where the polymorphic type is the common schema that stands for its various type instances. As a consequence, more terms (all and only the normalizing terms) can be typed than with universal polymorphism. Although intersection types were initially intended for use in analyzing and/or synthesizing lambda models as well as in analyzing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis and higher-order model checking. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2021 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus, pi-calculus and similar systems. - Applications for programming languages, program analysis, and program verification. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intensional types and/or denotational semantics to characterize computational properties. - Quantitative refinements of intersection types. ITRS workshops have been held every two years (with the exception of 2020, because of COVID-19 outbreak). Information about the previous events is available on the ITRS home page <http://itrs.di.unito.it/>. Invited Speaker - Jeremy Siek (Indiana University Bloomington) Paper Submissions Papers must be original and not previously published, nor submitted elsewhere. Papers should be prepared in LaTeX using the EPTCS macro <http://style.eptcs.org/> package and should be in the range of 3-16 pages, plus at most 2 pages of references. Submissions will be collected via EasyChair and reviewed by anonymous referees. Important Dates - Paper submission: 12 April 2021 - Author notification: 24 May 2021 - Final version: 18 June 2021 - Workshop: 17 July 2021 Program Committee - Antonio Bucciarelli, Université de Paris, France - Daniel De Carvalho, Innopolis University, Russia - Andrej Dudenhefner, Saarland University, Germany - Silvia Ghilezan, University of Novi Sad, Serbia - Giulio Guerrieri, University of Bath, UK - Ugo de' Liguoro, Università di Torino, Italy (chair) - Jeremy Siek, Indiana University Bloomington, USA (co-chair) Organizers Ugo de' Liguoro, Università di Torino, Italy Riccardo Treglia, Università di Torino, Italy (riccardo.treglia@unito.it) Steering Committee - Mariangiola Dezani-Ciancaglini, Università di Torino, Italy - Jakob Rehof, TU University of Dortmund, Germany - Joe Wells, Heriot-Watt University, Scotland [For admin and other information see: http://www.mta.ca/~cat-dist/ ]