A. W. Appel, Compiling with Continuations, 1992.
DOI : 10.1017/CBO9780511609619

A. Asperti, Abstract, Journal of Functional Programming, vol.456, issue.01, pp.23-59, 1992.
DOI : 10.1016/0304-3975(89)90105-9

G. Cousineau, P. Curien, and M. Mauny, The categorical abstract machine, Science of Computer Programming, vol.8, issue.2, pp.173-202, 1987.
DOI : 10.1016/0167-6423(87)90020-7

P. Crégut, Machines à environnement pour la réduction symbolique et l'évaluation partielle, Thèse de l'université de Paris VII, 1991.

P. Crégut, An abstract machine for Lambda-terms normalization, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.333-340, 1990.
DOI : 10.1145/91556.91681

P. Curien, An abstract framework for environment machines, Theoretical Computer Science, vol.82, issue.2, pp.389-402, 1991.
DOI : 10.1016/0304-3975(91)90230-Y
URL : http://doi.org/10.1016/0304-3975(91)90230-y

N. G. De-brujin, ?-calculus notation with nameless dummies: a tool for automatic formula manipulation , with application to Church Rosser theorem, Indagationes mathematicae, pp.381-392, 1972.

P. and D. Groote, An environment machine for the ????-calculus, Mathematical Structures in Computer Science, vol.8, issue.6, pp.637-669, 1998.
DOI : 10.1017/S0960129598002667
URL : https://hal.archives-ouvertes.fr/inria-00098499

R. Douence and P. Fradet, A taxonomy of functional language implementations. Part I: call-byvalue, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073908

R. Douence and P. Fradet, A taxonomy of functional language implementations. Part II: call-byname , call-by-need, and graph reduction, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073908

R. Douence, Décrire et comparer les mises en oeuvre de langages fonctionnels, 1996.

R. Douence and P. Fradet, A systematic study of functional language implementations, ACM Transactions on Programming Languages and Systems, vol.20, issue.2, pp.344-387, 1998.
DOI : 10.1145/276393.276397

J. Fairbairn and S. Wray, Tim: A simple, lazy abstract machine to execute supercombinators, Proc of FPCA'87, pp.34-45, 1987.
DOI : 10.1007/3-540-18317-5_3

P. Fradet and D. L. Métayer, Compilation of functional languages by program transformation, ACM Transactions on Programming Languages and Systems, vol.13, issue.1
DOI : 10.1145/114005.102805
URL : https://hal.archives-ouvertes.fr/inria-00075518

C. Hall, Using Hindley-Milner type inference to optimise list representation, Proc. of LFP'94, pp.162-172, 1994.
DOI : 10.1145/182409.156781
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9444

J. Hannan and D. Miller, From operational semantics to abstract machines: preliminary results, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90
DOI : 10.1145/91556.91680

T. Hardin, L. Maranget, and B. Pagano, Functional back-ends within the lambda-sigma calculus
DOI : 10.1145/232627.232632
URL : https://hal.archives-ouvertes.fr/inria-00073659

T. Johnsson, Compiling Lazy Functional Languages, 1987.

M. S. Joy, V. J. Rayward-smith, and F. W. Burton, Efficient combinator code, Computer Languages, vol.10, issue.3-4, 1985.
DOI : 10.1016/0096-0551(85)90017-7
URL : http://wrap.warwick.ac.uk/60770/1/joy_raywardsmith_cl.pdf

J. W. Klop, Term rewriting systems, In Handbook of Logic in Computer Science, vol.2, pp.2-108, 1992.

J. Krivine, Un interprète du lambda-calcul. Unpublished draft

P. J. Landin, The Mechanical Evaluation of Expressions, The Computer Journal, vol.6, issue.4, pp.308-320, 1964.
DOI : 10.1093/comjnl/6.4.308

F. Lang, Z. Benaissa, and P. Lescanne, Super-Closures, Proc. of WPAM'98, as Technical Report of the University of SaarBruck, 1998.

X. Leroy, The Zinc experiment: an economical implementation of the ML language, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00070049

X. Leroy, Unboxed objects and polymorphic typing, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.177-188, 1992.
DOI : 10.1145/143165.143205
URL : https://hal.archives-ouvertes.fr/hal-01499973

H. R. Nielson and F. Nielson, Semantics with Applications: A Formal Introduction, 1992.

M. Parigot, ?µ-Calculus: An algorithmic interpretation of classical natural deduction, Proc. of LPAR'92, LNAI, pp.190-201, 1992.

S. L. Peyton and . Jones, Implementing lazy functional languages on stock hardware: the spineless tagless G-machine, Journal of Func. Prog, vol.2, issue.2, pp.127-202, 1992.

S. L. , P. Jones, and D. Lester, Implementing functional languages, a tutorial, 1992.

S. L. Peyton-jones, W. Partain, and A. Santos, Let-floating: moving bindings to give faster programs, Proc. of ICFP'96, pp.1-12, 1996.

P. Sestoft, Analysis and efficient implementation of functional programs, 1991.

P. Sestoft, Deriving a lazy abstract machine, Journal of Functional Programming, vol.7, issue.3, pp.231-264, 1997.
DOI : 10.1017/S0956796897002712

Z. Shao, J. Reppy, and A. Appel, Unrolling lists, Proc. of LFP'94, pp.185-195, 1994.

T. Streicher and B. Reus, Classical logic, continuation semantics and abstract machines, Journal of Functional Programming, vol.8, issue.6, pp.543-572, 1998.
DOI : 10.1017/S0956796898003141

D. A. Turner, A new implementation technique for applicative languages. Software Practice and Experience, pp.31-49, 1979.