S. Abramsky and R. Jagadeesan, Abstract, The Journal of Symbolic Logic, vol.417, issue.02, pp.543-574, 1994.
DOI : 10.1007/BF01622878

S. Abramsky and R. Jagadeesan, A game semantics for generic polymorphism, Annals of Pure and Applied Logic, vol.133, pp.1-3, 2005.
DOI : 10.1016/j.apal.2004.10.002
URL : https://doi.org/10.1016/j.apal.2004.10.002

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930
URL : https://doi.org/10.1006/inco.2000.2930

S. Abramsky, R. Jagadeesan, and M. Vákár, Games for Dependent Types, 42nd International Colloquium on Automata, Languages, and Programming, pp.31-43, 2015.
DOI : 10.1007/978-3-662-47666-6_3

T. Altenkirch, C. Mcbride, and J. Mckinna, Why dependent types matter, 2005.

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

H. Barendregt, Lambda Calculi with Types, In Handbook of Logic in Computer Science, vol.2, pp.117-309, 1992.
DOI : 10.1017/cbo9781139032636

G. Berry, Bottom-up computation of recursive programs, Revue fran??aise d'automatique informatique recherche op??rationnelle. Informatique th??orique, vol.10, issue.R1, pp.47-82, 1976.
DOI : 10.1145/800235.807067
URL : https://www.rairo-ita.org/articles/ita/pdf/1976/01/ita197610R100471.pdf

G. Berry, Stable Models of Typed lambda-Calculi, 5th Colloquium on Automata, Languages and Programming, pp.72-89, 1978.
DOI : 10.1007/3-540-08860-1_7

G. Berry and P. Curien, Sequential algorithms on concrete data structures, Theoretical Computer Science, vol.20, issue.3, pp.265-321, 1982.
DOI : 10.1016/S0304-3975(82)80002-9
URL : https://doi.org/10.1016/s0304-3975(82)80002-9

R. Cartwright, P. Curien, and M. Felleisen, Fully Abstract Semantics for Observably Sequential Languages, Information and Computation, vol.111, issue.2, pp.297-401, 1994.
DOI : 10.1006/inco.1994.1047
URL : https://doi.org/10.1006/inco.1994.1047

P. Clairambault, Least and Greatest Fixpoints in Game Semantics, 12th International Conference on Foundations Of Software Science And Computational Structures, pp.16-31, 2009.
DOI : 10.2140/pjm.1955.5.285
URL : https://hal.archives-ouvertes.fr/hal-00443537

P. Clairambault and P. Dybjer, The biequivalence of locally cartesian closed categories and Martin-Löf type theories, Mathematical Structures in Computer Science, vol.24, issue.6, 2014.
DOI : 10.1007/978-3-642-21691-6_10
URL : http://hal-ens-lyon.archives-ouvertes.fr/docs/00/99/00/27/PDF/mainmscsrevised.pdf

P. Curien, Observable algorithms on concrete data structures, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.432-443, 1992.
DOI : 10.1109/LICS.1992.185554

P. Dybjer, Internal type theory, International Workshop on Types for Proofs and Programs, pp.120-134, 1995.
DOI : 10.1007/3-540-61780-9_66

H. Herbelin, On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic, 7th International Conference on Typed Lambda Calculi and Applications, pp.209-220, 2005.

M. Hofmann and T. Streicher, The Groupoid Interpretation of Type Theory In Twenty-Five Years of Constructive Type Theory, Proceedings of a Congress, pp.83-111, 1995.

M. Hyland and L. Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917
URL : https://doi.org/10.1006/inco.2000.2917

M. Hyland and A. Schalk, Games on Graphs and Sequentially Realizable Functionals, 17th IEEE Symposium on Logic in Computer Science, pp.257-264, 2002.
DOI : 10.1109/lics.2002.1029834
URL : http://www.cs.man.ac.uk/~schalk/publ/lics.pdf

G. Kahn and G. D. Plotkin, Concrete Domains. Theoretical Computer Science, vol.121, pp.1-2, 1993.

J. Laird, Game semantics for a polymorphic programming language, Journal of the ACM, vol.60, issue.4, p.29, 2013.

R. Loader, Finitary PCF is not decidable, Theoretical Computer Science, vol.266, issue.1-2, pp.341-364, 2001.
DOI : 10.1016/S0304-3975(00)00194-8

P. Martin-löf, Constructive Mathematics and Computer Programming, Studies in Logic and the Foundations of Mathematics, pp.153-175, 1982.
DOI : 10.1016/S0049-237X(09)70189-2

P. Martin-löf, Intuitionistic Type Theory, Bibliopolis, 1984.

G. Mccusker, Games and full abstraction for a functional metalanguage with recursive types, 1998.
DOI : 10.1007/978-1-4471-0615-9

E. Palmgren, An Information System Interpretation of Martin-L??f???s Partial Type Theory with Universes, Information and Computation, vol.106, issue.1, pp.26-60, 1993.
DOI : 10.1006/inco.1993.1048

E. Palmgren and V. Stoltenberg-hansen, Domain interpretations of martin-l??f???s partial type theory, Annals of Pure and Applied Logic, vol.48, issue.2, pp.135-196, 1990.
DOI : 10.1016/0168-0072(90)90044-3

A. M. Pitts, Relational Properties of Domains, Information and Computation, vol.127, issue.2, pp.66-90, 1996.
DOI : 10.1006/inco.1996.0052

D. Varacca, H. Völzer, and G. Winskel, Probabilistic Event Structures and Domains, 15th International Conference on Concurrency Theory, pp.481-496, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00148921

G. Winskel, Events in computation, 1980.