B. Accattoli, COCA HOLA. https://sites.google.com/site/ beniaminoaccattoli/coca-hola, 2016.

B. Accattoli, The Complexity of Abstract Machines, WPTE@FSCD 2016, pp.1-15, 2016.
DOI : 10.1007/3-540-36377-7_4
URL : https://hal.archives-ouvertes.fr/hal-01425560

B. Accattoli, The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus, WoLLIC 2016, pp.1-21, 2016.
DOI : 10.1007/s10990-007-9019-8
URL : https://hal.archives-ouvertes.fr/hal-01425534

B. Accattoli, P. Barenbaum, and D. Mazza, Distilling Abstract Machines, ICFP 2014, pp.363-376, 2014.
DOI : 10.1145/2628136.2628154

B. Accattoli, P. Barenbaum, and D. Mazza, A Strong Distillery, APLAS 2015, pp.231-250, 2015.
DOI : 10.1007/978-3-319-26529-2_13
URL : https://hal.archives-ouvertes.fr/hal-01244838

B. Accattoli and B. Barras, The Negligible and Yet Subtle Cost of Pattern Matching, 2017.
DOI : 10.1006/inco.1994.1093
URL : https://hal.archives-ouvertes.fr/hal-01675369

B. Accattoli and C. Sacerdoti-coen, On the Relative Usefulness of Fireballs, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.141-155, 2015.
DOI : 10.1109/LICS.2015.23
URL : https://hal.archives-ouvertes.fr/hal-01244833

B. Accattoli and U. D. Lago, On the Invariance of the Unitary Cost Model for Head Reduction, RTA 2012. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.22-37, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00780349

B. Accattoli and G. Guerrieri, Implementing Open Call-by- Value. Accepted at FSEN 2017, 2017.
DOI : 10.1007/978-3-319-68972-2_1
URL : https://hal.archives-ouvertes.fr/hal-01675365

B. Accattoli and C. Sacerdoti-coen, On the Value of Variables, WoLLIC 2014, pp.36-50, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01675373

M. Sig-ager, O. Danvy, and J. Midtgaard, A functional correspondence between call-by-need evaluators and lazy abstract machines, Information Processing Letters, vol.90, issue.5, pp.223-232, 2004.
DOI : 10.1016/j.ipl.2004.02.012

Z. M. Ariola, A. Bohannon, and A. Sabry, Sequent calculi and abstract machines, ACM Transactions on Programming Languages and Systems, vol.31, issue.4, pp.1-13, 2009.
DOI : 10.1145/1516507.1516508

M. Zena, M. Ariola, and . Felleisen, The Call-By-Need lambda Calculus, J. Funct. Program, vol.7, issue.3, pp.265-301, 1997.

T. Balabonski, P. Barenbaum, E. Bonelli, and D. Kesner, Foundations of strong call by need, Proceedings of the ACM on Programming Languages, vol.1, issue.ICFP, 2017.
DOI : 10.1016/0304-3975(92)90297-S

B. Barras, Auto-validation d'un système de preuves avec familles inductives, 1999.

E. Guy, J. Blelloch, and . Greiner, Parallelism in Sequential Functional Languages, FPCA 1995, pp.226-237, 1995.

S. Chang and M. Felleisen, The Call-by-Need Lambda Calculus, Revisited, ESOP 2012, pp.128-147, 2012.
DOI : 10.1007/978-3-642-28869-2_7

C. Development and T. , The Coq Proof-Assistant Reference Manual, version 8.6, 2016.

P. Crégut, Strongly reducing variants of the Krivine abstract machine, Higher-Order and Symbolic Computation, pp.209-230, 2007.
DOI : 10.1007/s10990-007-9015-z

O. Danvy and L. R. Nielsen, Refocusing in Reduction Semantics, BRICS Report Series, vol.11, issue.26, 2004.
DOI : 10.7146/brics.v11i26.21851
URL : http://www.brics.dk/RS/04/Ref/BRICS-RS-04-Ref/../../../../RS/04/26/BRICS-RS-04-26.ps.gz

O. Danvy and I. Zerny, A synthetic operational account of call-byneed evaluation, PPDP 2013, pp.97-108, 2013.

M. Felleisen and D. P. Friedman, Control operators, the SECDmachine , and the lambda-calculus, 3rd Working Conference on the Formal Description of Programming Concepts, 1986.

M. Fernández and N. Siafakas, New Developments in Environment Machines, Electronic Notes in Theoretical Computer Science, vol.237, pp.57-73, 2009.
DOI : 10.1016/j.entcs.2009.03.035

R. Garcia, A. Lumsdaine, and A. Sabry, Lazy evaluation and delimited control, POPL 2009, pp.153-164, 2009.
DOI : 10.1145/1480881.1480903
URL : http://arxiv.org/pdf/1003.5197

B. Grégoire and X. Leroy, A compiled implementation of strong reduction, pp.235-246, 2002.

T. Hardin and L. Maranget, Functional runtime systems within the lambda-sigma calculus, Journal of Functional Programming, vol.8, issue.2, pp.131-176, 1998.
DOI : 10.1017/S0956796898002986
URL : https://hal.archives-ouvertes.fr/hal-01199543

J. Jeannin and D. Kozen, Computing with Capsules, Journal of Automata, Languages and Combinatorics, vol.17, pp.2-4, 2012.
DOI : 10.1007/978-3-642-31623-4_1

J. Krivine, A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation, pp.199-207, 2007.
DOI : 10.1007/s10990-007-9018-9
URL : https://hal.archives-ouvertes.fr/hal-00154508

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

J. Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.144-154, 1993.
DOI : 10.1145/158511.158618
URL : http://turing.wins.uva.nl/~yde/teaching/svp/launchbury.ps

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

J. Maraist, M. Odersky, and P. Wadler, The call-by-need lambda calculus, Journal of Functional Programming, vol.8, issue.3, pp.275-317, 1998.
DOI : 10.1017/S0956796898003037

C. Okasaki, Purely functional random-access lists, Proceedings of the seventh international conference on Functional programming languages and computer architecture , FPCA '95, pp.86-95, 1995.
DOI : 10.1145/224164.224187
URL : http://www.cs.columbia.edu/~cdo/fpca95.ps

P. Pédrot and A. Saurin, Classical By-Need, ESOP 2016, pp.616-643, 2016.
DOI : 10.1017/S0956796898003141

G. D. Plotkin, Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975.
DOI : 10.1016/0304-3975(75)90017-1

D. Sands, J. Gustavsson, and A. Moran, Lambda Calculi and Linear Speedups, The Essence of Computation, pp.60-84, 2002.
DOI : 10.1007/3-540-36377-7_4
URL : http://w2.cadence.com/company/cadence_labs/jorgeng_EC_2002_Lambda.pdf

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

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

M. Wand, On the correctness of the Krivine machine, Higher-Order and Symbolic Computation, pp.231-235, 2007.
DOI : 10.1007/s10990-007-9019-8