Intersection Types and Related Systems 2010
associated with LICS
Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. Although they were initially intended for use in analysing and/or synthesizing lambda models as well as in analysing 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. 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 2010 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches (e.g., union types, refinement types, behavioural types).
More information can be found here.
- Adriana Compagnoni, Stevens Inst. of Technology, New-Jersey
- Simona Ronchi Della Rocca, Univ. degli Studi di Torino