T. Abel, P. Coquand, and . Dybjer, Normalization by evaluation for Martin-Löf type theory with typed equality judgements, LICS, pp.3-12, 2007.

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

G. Abramsky and . Mccusker, Linearity, sharing and state, Algol-like languages, pp.297-329, 1997.

P. Altenkirch, M. Dybjer, P. J. Hofmann, and . Scott, Normalization by evaluation for typed lambda calculus with coproducts, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.303-312, 2001.
DOI : 10.1109/LICS.2001.932506

H. Berger and . Schwichtenberg, An inverse of the evaluation functional for typed lambdacalculus, LICS, pp.203-212, 1991.

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

. Damm, The IO- and OI-hierarchies, Theoretical Computer Science, vol.20, issue.2, pp.95-207, 1982.
DOI : 10.1016/0304-3975(82)90009-3

G. De-bruijn, Lambda calculus notation with nameless dummies, Indagationes Mathematicae (Proceedings), pp.381-392, 1972.

A. Dybjer and . Filinski, Normalization and Partial Evaluation, APPSEM, LNCS 2395, pp.137-192, 2000.
DOI : 10.1007/3-540-45699-6_4

A. S. Hague, C. L. Murawski, O. Ong, and . Serre, Collapsible Pushdown Automata and Recursion Schemes, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.452-461, 2008.
DOI : 10.1109/LICS.2008.34
URL : https://hal.archives-ouvertes.fr/hal-00345945

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

. Kobayashi, Types and higher-order recursion schemes for verification of higher-order programs, POPL, pp.416-428, 2009.

. Laird, Full abstraction for functional languages with control, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.58-67, 1997.
DOI : 10.1109/LICS.1997.614931

. Loader, Finitary PCF is not decidable, Proc. Symp. ?-calculus and Computer Science, pp.341-364, 1975.
DOI : 10.1016/S0304-3975(00)00194-8
URL : http://doi.org/10.1016/s0304-3975(00)00194-8

-. L. Ong, On Model-Checking Trees Generated by Higher-Order Recursion Schemes, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.81-90, 2006.
DOI : 10.1109/LICS.2006.38

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

I. Salvati and . Walukiewicz, Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata, RP, pp.6-20, 2012.
DOI : 10.1007/978-3-642-33512-9_2
URL : https://hal.archives-ouvertes.fr/hal-00717718