A. Asperti, (Optimal) duplication is not elementary recursive, Information and Computation, vol.193, issue.1, pp.21-56, 2004.
DOI : 10.1016/j.ic.2004.05.001
URL : http://doi.org/10.1016/j.ic.2004.05.001

. Barendregt, A filter lambda model and the completeness of type assignment, The Journal of Symbolic Logic, vol.37, issue.04, pp.931-940, 1983.
DOI : 10.1002/malq.19800261902

. Coppo, Extended Type Structures and Filter Lambda Models, Logic Colloquium '82, pp.241-262, 1983.
DOI : 10.1016/S0049-237X(08)71819-6

. Van-bakel, Comparing cubes of typed and type assignment systems, Annals of Pure and Applied Logic, vol.86, issue.3, pp.267-303, 1997.
DOI : 10.1016/S0168-0072(96)00036-X
URL : https://hal.archives-ouvertes.fr/hal-01154638

B. Capitani and B. Venneri, Hyperformulae, Parallel Deductions and Intersection Types, Proc. BOTH 2001, pp.180-198, 2001.
DOI : 10.1016/S1571-0661(04)00172-0
URL : http://doi.org/10.1016/s1571-0661(04)00172-0

D. Coppo, M. Coppo, and M. Dezani-ciancaglini, An extension of the basic functionality theory for the $\lambda$-calculus., Notre Dame Journal of Formal Logic, vol.21, issue.4, pp.685-693, 1980.
DOI : 10.1305/ndjfl/1093883253

. Dezani-ciancaglini, Intersection-types, Lambda-models and Böhm Trees, MSJ-Memoir, 1998.
DOI : 10.2969/msjmemoirs/00201c020
URL : http://projecteuclid.org/download/pdf_1/euclid.msjm/1389985700

. Giannini, Type Inference: Some Results, Some Problems, Fundamenta Informaticae, vol.19, issue.12, pp.87-126, 1993.

J. Girard, The system F of variable types, fifteen years later, Theoretical Computer Science, vol.45, pp.159-192, 1986.
DOI : 10.1016/0304-3975(86)90044-7

J. R. Hindley, Coppo-Dezani types do not correspond to propositional logic, Theoretical Computer Science, vol.28, issue.1-2, pp.235-236, 1984.
DOI : 10.1016/0304-3975(83)90074-9
URL : http://doi.org/10.1016/0304-3975(83)90074-9

W. A. Howard, The Formulae-as-Types Notion of Construction, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.479-490, 1980.

J. L. Krivine, Lambda-calcul, Types et Modèles, 1990.

D. Leivant, Polymorphic type inference, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '83, pp.88-98, 1983.
DOI : 10.1145/567067.567077

L. Liquori, Type Assigment Systems for Lambda Calculi and for the Lambda Calculus of Objects, 1996.
URL : https://hal.archives-ouvertes.fr/tel-01157160

T. Pierce, B. Pierce, C. Turner, D. , and N. , Abstract, Journal of Functional Programming, vol.34, issue.02, pp.207-247, 1994.
DOI : 10.1016/0890-5401(88)90007-7
URL : https://hal.archives-ouvertes.fr/inria-00074772

[. and D. Rocca, Ronchi Della Rocca S Intersection-Typed Lambda- Calculus, Proc of ICTRS, 2002.

L. Roversi, Intersection Logic, Proc. of CSL, LNCS 2142, pp.414-428, 2001.

. Wells, A calculus with polymorphic and polyvariant flow types, Journal of Functional Programming, vol.12, issue.03, pp.183-227, 2002.
DOI : 10.1017/S0956796801004245

H. Wells, J. B. Wells, and C. Haack, Branching Types, Information and Computation, 2006.
DOI : 10.1007/3-540-45927-8_9