1. Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics, revised edn. North-Holland, Amsterdam (1984)
2. Ben-Yelles, C.: Type-assignment in the lambda-calculus; syntax and semantics. PhD thesis, University of Wales Swansea (1979)
3. Bernadet, A., Lengrand, S.: Non-idempotent intersection types and strong normalisation. Logical Methods in Computer Science 9(4) (2013)
4. Bunder, M.W.: The inhabitation problem for intersection types. In: CATS. CRPIT, vol. 77, pp. 7–14. Australian Computer Society (2008)
5. Carvalho, D.D.: Sèmantique de la logique linéaire et temps de calcul. PhD thesis, Université de la Mediterranée Aix-Marseille 2 (2007)