Fabio Alessi, Franco Barbanera & Mariangiola Dezani-Ciancaglini (2006):
Intersection types and lambda models.
Theoretical Computer Science 355(2),
pp. 108–126,
doi:10.1016/j.tcs.2006.01.004.
Steffen van Bakel (1995):
Intersection Type Assignment Systems.
Theoretical Computer Science 151(2),
pp. 385–435,
doi:10.1016/0304-3975(95)00073-6.
Jan Bessai, Tzu-Chun Chen, Andrej Dudenhefner, Boris Düdder, Ugo de Liguoro & Jakob Rehof (2018):
Mixin Composition Synthesis Based on Intersection Types.
Logical Methods in Computer Science 14,
pp. 37,
doi:10.23638/LMCS-14(1:18)2018.
Henk Barendregt, Mario Coppo & Mariangiola Dezani-Ciancaglini (1983):
A Filter Lambda Model and the Completeness of Type Assignment.
Journal of Symbolic Logic 48,
pp. 931–940,
doi:10.2307/2273659.
Andrew Kennedy & Benjamin Pierce (2007):
On Decidability of Nominal Subtyping with Variance.
In: International Workshop on Foundations and Developments of Object-Oriented Languages (FOOL/WOOD '07).
url: http://foolwood07.cs.uchicago.edu/program/kennedy.pdf+.2777em.
Olivier Laurent (2012):
A syntactic introduction to intersection types.
Unpublished note. url: http://perso.ens-lyon.fr/olivier.laurent/tutinter.pdf+.2777em.
Simona Ronchi Della Rocca & Luca Paolini (2004):
The Parametric Lambda Calculus.
Texts in Theoretical Computer Science.
Springer,
doi:10.1007/978-3-662-10394-4.
Betti Venneri (1994):
Intersection Types as Logical Formulae.
Journal of Logic and Computation 4(2),
pp. 109–124,
doi:10.1093/logcom/4.2.109.
eptcs@eptcs.org