A. Abel, Normalization by Evaluation: Dependent Types and Impredicativity, 2013.

A. Abel, K. Aehlig, and P. Dybjer, Normalization by evaluation for Martin-Löf type theory with one universe, 23rd Conference on the Mathematical Foundations of Programming Semantics, pp.17-40, 2007.

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

K. Aehlig and F. Joachimski, Operational aspects of untyped Normalisation by Evaluation, Mathematical Structures in Computer Science, vol.14, issue.4, 2004.
DOI : 10.1017/S096012950400427X

R. Amadio and P. Curien, Domains and lambda-calculi. Number 46, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00070008

U. Berger and H. Schwichtenberg, An inverse of the evaluation functional for typed lambda -calculus, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.203-211, 1991.
DOI : 10.1109/LICS.1991.151645

J. Cartmell, Generalised algebraic theories and contextual categories, Annals of Pure and Applied Logic, vol.32, pp.209-243, 1986.
DOI : 10.1016/0168-0072(86)90053-9

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.5, p.2013

P. Clairambault and A. S. Murawski, Böhm trees as higher-order recursive schemes, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, pp.91-102, 2013.

P. Curien, Abstract B??hm trees, Mathematical Structures in Computer Science, vol.8, issue.6, pp.559-591, 1998.
DOI : 10.1017/S0960129598002631

P. Curien, Notes on game semantics. From the author's web page, 2006.

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

P. Dybjer, Program Testing and the Meaning Explanations of Intuitionistic Type Theory, Epistemology versus Ontology -Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf, pp.215-241
DOI : 10.1007/978-94-007-4435-6_11

P. Dybjer and D. Kuperberg, Formal neighbourhoods, combinatory B??hm trees, and untyped normalization by evaluation, Annals of Pure and Applied Logic, vol.163, issue.2, pp.122-131, 2012.
DOI : 10.1016/j.apal.2011.06.021

A. Filinski and H. Rohde, Denotational aspects of untyped normalization by evaluation, RAIRO - Theoretical Informatics and Applications, vol.39, issue.3, pp.423-453, 2005.
DOI : 10.1051/ita:2005026

R. Harmer, M. Hyland, and P. Es, Categorical combinators for innocent strategies, 22nd IEEE Symposium on Logic in Computer Science, pp.379-388, 2007.

J. M. Hyland and C. 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

G. Mccusker, Games and Full Abstraction for FPC, Information and Computation, vol.160, issue.1-2, pp.1-61, 2000.
DOI : 10.1006/inco.1999.2845

A. M. Pitts, A co-induction principle for recursively defined domains, Theoretical Computer Science, vol.124, issue.2, pp.195-219, 1994.
DOI : 10.1016/0304-3975(94)90014-0

G. D. Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, pp.223-255, 1977.
DOI : 10.1016/0304-3975(77)90044-5

G. D. Plotkin, Post-graduate lecture notes in advanced domain theory (incorporating the " Pisa Notes " ). Dept, 1981.