. Alberti, On operational properties of quantitative extensions of ?-calculus, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01096067

G. Arrighi and . Dowek, Linear-algebraic lambda-calculus: higher-order, encodings, and confluence, RTA, 2008.

T. Bucciarelli, G. Ehrhard, and . Manzonetto, Not Enough Points Is Enough, CSL 2007, 2007.
DOI : 10.1007/978-3-540-74915-8_24
URL : https://hal.archives-ouvertes.fr/hal-00148820

T. Danos and . Ehrhard, Probabilistic coherence spaces as a model of higher-order probabilistic computation. Information and Computation, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00640435

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

A. De-'liguoro and . Piperno, Nondeterministic extensions of untyped ?-calculus. Information and Computation, 1995.

. Díaz-caro, Du typage vectoriel, 2011.

. Ehrhard, On Köthe sequence spaces and linear logic, Math. Struct. in Comp. Sci, 2001.

. Ehrhard, Finiteness spaces, Mathematical Structures in Computer Science, vol.15, issue.4, pp.615-646, 2005.
DOI : 10.1017/S0960129504004645
URL : https://hal.archives-ouvertes.fr/hal-00150276

. Ehrhard, A Finiteness Structure on Resource Terms, 2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010.
DOI : 10.1109/LICS.2010.38
URL : https://hal.archives-ouvertes.fr/hal-00448431

L. Ehrhard and . Regnier, The differential lambda-calculus, Theoretical Computer Science, vol.309, issue.1-3, 2003.
DOI : 10.1016/S0304-3975(03)00392-X
URL : https://hal.archives-ouvertes.fr/hal-00150572

L. Ehrhard and . Regnier, Böhm trees, Krivine's machine and the Taylor expansion of ?-terms, CiE, 2006.

L. Ehrhard and . Regnier, Uniformity and the Taylor expansion of ordinary lambda-terms, Theoretical Computer Science, vol.403, issue.2-3, 2008.
DOI : 10.1016/j.tcs.2008.06.001
URL : https://hal.archives-ouvertes.fr/hal-00150275

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

-. Girard, Normal functors, power series and lambda-calculus. Annals of Pure and Applied Logic, 1988.

. Hasegawa, The generating functions of lambda terms, First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996.

. Joyal, Foncteurs analytiques et espèces de structures Colloque de combinatoire énumérative, Proceedings of the, 1985.

R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. De-vries, Infinitary lambda calculus. Theor. Comp. Sci, 1997.

. Laird, Fixed Points In Quantitative Semantics, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, 2016.
DOI : 10.1109/LICS.2000.855753

G. Laird, G. Manzonetto, M. Mccusker, and . Pagani, Weighted Relational Models of Typed Lambda-Calculi, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013.
DOI : 10.1109/LICS.2013.36
URL : https://hal.archives-ouvertes.fr/hal-01144064

. Leventis, Probabilistic ?-theories, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01427279

C. Pagani, L. Tasson, and . Vaux, Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ ?? -terms, FOSSACS 2016, 2016.
DOI : 10.1016/j.apal.2011.09.001

T. Tsukada, K. Asada, and L. Ong, Generalised species of rigid resource terms, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017.
DOI : 10.1109/LICS.2017.8005093

. Vaux, The algebraic lambda calculus, Mathematical Structures in Computer Science, vol.12, issue.05, 2009.
DOI : 10.1016/S0304-3975(03)00392-X
URL : https://hal.archives-ouvertes.fr/hal-00379750