ITRS accepted papers

Regular papers

Fabio Alessi, U Udine, Italy and Stefania Lusin, U Venice, Italy
Simple easy terms

Sebastien Carlier, LRDE EPITA, France
Polar type inference with intersection types and omega

JudicaŽl Courant, U Paris XI (Paris-Sud), France
Strong normalization with singleton types

Ugo de'Liguoro, U Turin, Italy
Subtyping in logical form

Mariangiola Dezani-Ciancaglini, U Turin, Italy; Alain Frish, ENS Paris, France; Elio Giovanetti, U Turin, Italy; and Yoko Motohama, U Udine, Italy
The relevance of semantic subtyping

Silvia Ghilezan, ENS Lyon, France and Silvia Likavec, U Turin, Italy
Reducibility: a ubiquitous method in lambda calculus with intersection types

Assaf J. Kfoury, Boston U, USA; Geoffrey Washburn, Boston U, USA; and Joe Wells, Heriot-Watt U, UK
Implementing compositional analysis using intersection types with expansion variables

Daniel Leivant, Indiana U Bloomington, USA
Feasible functionals and intersection of ramified type

Simona Ronchi Della Rocca, U Turin, Italy
Intersection typed lambda calculus

Steffen van Bakel, Imperial College, UK
Strongly normalising cut-elimination with strict intersection types

† † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † †