R. Amadio and P. L. Curien, Domains and Lambda-Calculi. Number 46 in Cambridge Tracts in Theoretical Computer Science, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00070008

P. Arrighi and A. Díaz-caro, A System F accounting for scalars, Logical Methods in Computer Science, vol.8, issue.1, p.11, 2012.
DOI : 10.2168/LMCS-8(1:11)2012

URL : https://hal.archives-ouvertes.fr/hal-00924944

P. Arrighi, A. Díaz-caro, and B. Valiron, A Type System for the Vectorial Aspect of the Linear-Algebraic Lambda-Calculus, Electronic Proceedings in Theoretical Computer Science, vol.88, pp.1-15, 2012.
DOI : 10.4204/EPTCS.88.1

URL : https://hal.archives-ouvertes.fr/hal-00924926

P. Arrighi and G. Dowek, Linear-algebraic lambda-calculus: higher-order, encodings, and confluence, LNCS, vol.5117, pp.17-31, 2008.

H. Barendregt, The lambda calculus: its syntax and semantics, 1984.

A. Bernadet and S. Lengrand, Complexity of strongly normalising ?-terms via nonidempotent intersection types, pp.88-107, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01110489

G. Boudol, Lambda-Calculi for (Strict) Parallel Functions, Information and Computation, vol.108, issue.1, pp.51-127, 1994.
DOI : 10.1006/inco.1994.1003

URL : https://hal.archives-ouvertes.fr/inria-00075174

F. Breuvart, On the discriminating power of tests in the resource ?-calculus Submitted

A. Bucciarelli, T. Ehrhard, and G. Manzonetto, A relational semantics for parallelism and non-determinism in a functional setting, Annals of Pure and Applied Logic, vol.163, issue.7, pp.918-934, 2012.
DOI : 10.1016/j.apal.2011.09.008

URL : https://hal.archives-ouvertes.fr/hal-00707776

M. Coppo and M. Dezani-ciancaglini, A new type assignment for ??-terms, Archiv f??r Mathematische Logik und Grundlagenforschung, vol.5, issue.1, pp.139-156, 1978.
DOI : 10.1007/BF02011875

D. De-carvalho, Execution time of lambda-terms via denotational semantics and intersection types, To appear in Math. Struct. in Comp. Sci, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00319822

M. Dezani-ciancaglini, U. De-'liguoro, and A. Piperno, Filter models for conjunctive-disjunctive ??-calculi, Theoretical Computer Science, vol.170, issue.1-2, pp.83-128, 1996.
DOI : 10.1016/S0304-3975(96)80703-1

M. Dezani-ciancaglini, U. De-'liguoro, and A. Piperno, A Filter Model for Concurrent $\lambda$-Calculus, SIAM Journal on Computing, vol.27, issue.5, pp.1376-1419, 1998.
DOI : 10.1137/S0097539794275860

T. Ehrhard, Collapsing non-idempotent intersection types. In: CSL'12, LIPIcs, vol.16, pp.259-273, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00712219

J. Y. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4

URL : https://hal.archives-ouvertes.fr/inria-00075966

J. L. Krivine, Lambda-calcul: types et modèles. ´ Etudes et recherches en informatique, 1990.

O. Laurent, ´ Etude de la polarisation en logique, 2002.

G. Manzonetto, A general class of models of H, MFCS'09, pp.574-586, 2009.

J. Maraist, M. Odersky, D. N. Turner, and P. Wadler, Call-by-name, call-by-value, call-by-need and the linear lambda calculus, Theoretical Computer Science, vol.228, issue.1-2, pp.175-210, 1999.
DOI : 10.1016/S0304-3975(98)00358-2

M. Pagani and S. Ronchi-della-rocca, Linearity, non-determinism and solvability, Fundam. Inform, vol.103, pp.1-4, 2010.

G. D. Plotkin, Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975.
DOI : 10.1016/0304-3975(75)90017-1

P. Sallé, Une g??n??ralisation de la th??orie des types en $\lambda $-calcul, RAIRO. Informatique th??orique, vol.14, issue.2, pp.143-167, 1980.
DOI : 10.1051/ita/1980140201431

L. Vaux, The algebraic lambda calculus, Mathematical Structures in Computer Science, vol.12, issue.05, pp.1029-1059, 2009.
DOI : 10.1016/S0304-3975(03)00392-X

URL : https://hal.archives-ouvertes.fr/hal-00379750