M. Abadi, L. Cardelli, P. Curien, and J. Lévy, Abstract, Journal of Functional Programming, vol.34, issue.04, pp.375-416, 1991.
DOI : 10.1016/0304-3975(86)90035-6

S. Abramsky, The lazy lambda calculus, Research Topics in Functional Programming, pp.65-116, 1990.

M. S. Ager, D. Biernacki, O. Danvy, and J. Midtgaard, From Interpreter to Compiler and Virtual Machine: A Functional Derivation, BRICS Report Series, vol.10, issue.14, 2003.
DOI : 10.7146/brics.v10i14.21784

M. S. Ager, D. Biernacki, O. Danvy, and J. Midtgaard, A Functional Correspondence between Evaluators and Abstract Machines, Basic Research in Computer Science, 2003.

M. Zena, M. Ariola, and . Felleisen, The call-by-need lambda calculus, Journal of Functional Programming, vol.7, issue.3, pp.265-301, 1997.

Z. E. Benaissa, P. Lescanne, and K. H. Rose, Modeling Sharing and Recursion for Weak Reduction Strategies using Explicit Substitution, Proceedings of the Symposium on Programming Languages: Implementation, Logics and Programs PLILP'96, number 1140, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073599

P. Crégut, MachinesàMachinesà environnement pour la réduction symbolique et l'´ evaluation partielle, 1991.

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

P. Curien, T. Hardin, and J. Lévy, Weak and Strong Confluent Calculi of Explicit Substitutions, Journal of the ACM, vol.43, issue.2, 1996.

N. G. De-bruijn, Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Proc. Koninkl. Nederl. Akademie van Wetenschappen, pp.381-392, 1972.

J. Fairbairn and S. C. Wray, Tim: A simple, lazy abstract machine to execute supercombinators, Functional Programming and Computer Architecture, number 274 in LNCS, pp.34-45, 1987.
DOI : 10.1007/3-540-18317-5_3

J. Gustavsson, A Type Based Sharing Analysis for Update Avoidance and Optimisation, Thesis for the Licentiate Degree, 1999.

T. Hardin, L. Maranget, and B. Pagano, Functional back-ends within the lambdasigma calculus, Proceeding of the International Conference on Functional Programming ICFP'96, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073659

T. Johnsson, Efficient compilation of lazy evaluation, ACM SIGPLAN Notices, vol.19, issue.6, pp.58-69, 1984.
DOI : 10.1145/502949.502880

F. Lang, Modèles de la 'b-réduction pour les implantations, 1998.

F. Lang, D. J. Dougherty, P. Lescanne, and K. H. Rose, Addressed Term Rewriting Systems, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01152576

F. Lang, P. Lescanne, and L. Liquori, A framework for defining object-calculi, Proceedings of Formal Methods Europe FME'99, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01153772

J. Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, 1993.
DOI : 10.1145/158511.158618

J. Mountjoy, The spineless tagless G-machine, naturally, Proceedings of the third ACM SIGPLAN International Conference on Functional Programming ICFP'99, pp.163-173, 1998.

S. L. Peyton and . Jones, Implementing Lazy Functional Programming Languages on Stock Hardware: the Spineless Tagless G-machine, Journal of Functional Programming, vol.2, issue.2, pp.127-202, 1992.

K. H. Rose, Operational Reduction Models for Functional Programming Languages, 1996.

R. Kristoffer-høgsbro, Explicit Cyclic Substitutions, Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems CTRS'92, number 656 in LNCS, 1992.

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, 1997.
DOI : 10.1017/S0956796897002712

C. P. Wadsworth, Semantics and pragmatics of the lambda calculus, 1971.