J. 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

D. S. Scott, Data Types as Lattices, SIAM Journal on Computing, vol.5, issue.3, pp.522-587, 1976.
DOI : 10.1137/0205037

G. Berry, Stable models of typed ??-calculi, Lecture Notes in Computer Science, vol.62, pp.72-89, 1978.
DOI : 10.1007/3-540-08860-1_7

J. Girard, Normal functors, power series and ??-calculus, Annals of Pure and Applied Logic, vol.37, issue.2, pp.129-177, 1988.
DOI : 10.1016/0168-0072(88)90025-5

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

C. Berline, Graph models of $\lambda$-calculus at work, and variations, Mathematical Structures in Computer Science, vol.16, issue.02, pp.185-221, 2006.
DOI : 10.1017/S0960129506005123
URL : https://hal.archives-ouvertes.fr/hal-00004473

R. Statman, Completeness, invariance and ??-definability, The Journal of Symbolic Logic, vol.344, issue.01, pp.17-26, 1982.
DOI : 10.1016/0304-3975(76)90021-9

C. Daniel-de, Sémantiques de la logique linéaire et temps de calcul, Thèse de doctorat, 2007.

T. 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

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

T. Ehrhard and L. Regnier, Differential Interaction Nets, Electronic Notes in Theoretical Computer Science, vol.123, pp.35-74, 2005.
DOI : 10.1016/j.entcs.2004.06.060
URL : https://hal.archives-ouvertes.fr/hal-00150274

T. Ehrhard and L. Regnier, B??hm Trees, Krivine???s Machine and the Taylor Expansion of Lambda-Terms, Lecture Notes in Computer Science, vol.227, issue.1???2, pp.186-197, 2006.
DOI : 10.1093/logcom/10.3.411

T. Ehrhard and O. Laurent, Interpreting a finitary pi-calculus in differential interaction nets, Information and Computation, vol.208, issue.6, pp.606-633, 2010.
DOI : 10.1016/j.ic.2009.06.005
URL : https://hal.archives-ouvertes.fr/hal-00483780

P. Tranquilli, Intuitionistic differential nets and lambda-calculus, Theoretical Computer Science, vol.412, issue.20, pp.1979-1997, 2011.
DOI : 10.1016/j.tcs.2010.12.022

L. Vaux, Differential Linear Logic and Polarization, Curien [34], pp.371-385
DOI : 10.1016/0890-5401(92)90008-4
URL : https://hal.archives-ouvertes.fr/hal-00387062

C. Tasson, Algebraic Totality, towards Completeness, Curien [34], pp.325-340
DOI : 10.1007/978-3-540-73449-9_28
URL : https://hal.archives-ouvertes.fr/hal-00440750

M. Pagani and C. Tasson, The Inverse Taylor Expansion Problem in Linear Logic, 2009 24th Annual IEEE Symposium on Logic In Computer Science, 2009.
DOI : 10.1109/LICS.2009.35
URL : https://hal.archives-ouvertes.fr/hal-00440684

C. Daniel-de, Execution time of lambda-terms via denotational semantics and intersection types, 2008.

A. Bucciarelli, T. Ehrhard, and G. Manzonetto, Not Enough Points Is Enough, In Computer Science Logic Lecture Notes in Computer Science, vol.4646, pp.298-312, 2007.
DOI : 10.1007/978-3-540-74915-8_24
URL : https://hal.archives-ouvertes.fr/hal-00148820

M. Thibault, Pre-recursive categories, Journal of Pure and Applied Algebra, vol.24, issue.1, pp.79-93, 1982.
DOI : 10.1016/0022-4049(82)90060-3

J. Lambek and P. J. Scott, Introduction to higher order categorical logic, 1988.

J. Girard, P. Taylor, and Y. Lafont, Proofs and types, CUP, 1989.

M. Parigot, On the representation of data in lambda-calculus, Lecture Notes in Computer Science, vol.440, pp.309-321, 1989.
DOI : 10.1007/3-540-52753-2_47

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

A. Bucciarelli, T. Ehrhard, and G. Manzonetto, A Relational Model of a Parallel and Non-deterministic ??-Calculus, LFCS, pp.107-121, 2009.
DOI : 10.1017/S0956796801004294
URL : https://hal.archives-ouvertes.fr/hal-00283095

V. Danos and T. Ehrhard, On probabilistic coherence spaces, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00280462

P. Arrighi and G. Dowek, Linear-algebraic ??-calculus: higher-order, encodings, and confluence., Rewriting Techniques and Applications, 19th International Conference, RTA-2008, pp.17-31, 2008.
DOI : 10.1007/978-3-540-70590-1_2

P. Curien, H. Herbelin, J. Krivine, and P. Melliès, Interactive models of computation and program behaviour, of Panoramas et synthèses, pp.1-196, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00697119

M. Hyland and A. Schalk, Glueing and orthogonality for models of linear logic, Theoretical Computer Science, vol.294, issue.1-2, pp.183-231, 2003.
DOI : 10.1016/S0304-3975(01)00241-9

R. Carl-backhouse and P. F. Hoogendijk, Chapter 3. Generic Properties of Datatypes, Generic Programming, pp.97-132, 2003.
DOI : 10.1007/978-3-540-45191-4_3

R. Carl-backhouse, P. J. De-bruin, P. F. Hoogendijk, and G. Malcolm, Ed Voermans , and Jaap van der Woude. Polynomial relators, AMAST, Workshops in Computing, pp.303-326, 1991.

P. Hoogendijk and O. De-moor, Container types categorically, Journal of Functional Programming, vol.10, issue.2, pp.191-225, 2000.
DOI : 10.1017/S0956796899003640

C. Tasson and L. Vaux, Transport of finiteness structures and applications. to appear in Mathematical Structures in Computer Science, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00475004