M. Abadi, L. Cardelli, P. L. Curien, and J. J. Lévy, Abstract, Journal of Functional Programming, vol.34, issue.04, pp.375-416, 1991.
DOI : 10.1016/B978-0-12-115350-2.50017-8

B. Accattoli, An abstract factorization theorem for explicit substitutions, pp.6-21, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00780344

B. Accattoli, COCA HOLA. https://sites.google.com/site, 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, 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, pp.363-376, 2014.
DOI : 10.1145/2628136.2628154

B. Accattoli and B. Barras, Environments and the complexity of abstract machines, Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming , PPDP '17, 2017.
DOI : 10.1007/s10990-007-9019-8
URL : https://hal.archives-ouvertes.fr/hal-01675358

B. Accattoli, E. Bonelli, D. Kesner, and C. Lombardi, A nonstandard standardization theorem, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.659-670, 2014.
DOI : 10.1145/2535838.2535886

B. Accattoli and C. S. 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. Dal-lago, (Leftmost-Outermost) Beta Reduction is Invariant, Indeed, Logical Methods in Computer Science, vol.12, issue.1, 2016.
DOI : 10.2168/LMCS-12(1:4)2016
URL : https://hal.archives-ouvertes.fr/hal-01337712

B. Accattoli and G. Guerrieri, Open Call-by-Value, pp.206-226978, 2016.
DOI : 10.1007/3-540-36377-7_4
URL : https://hal.archives-ouvertes.fr/hal-01425465

B. Accattoli and G. Guerrieri, Implementing Open Call-by-Value, 2017.
DOI : 10.1007/s10990-007-9019-8
URL : https://hal.archives-ouvertes.fr/hal-01675365

B. Accattoli and L. Paolini, Call-by-Value Solvability, Revisited, pp.4-16, 2012.
DOI : 10.1007/978-3-642-29822-6_4
URL : https://hal.archives-ouvertes.fr/hal-00780358

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

Z. M. Ariola and M. Felleisen, The call-by-need lambda calculus, Journal of Functional Programming, vol.7, issue.3, pp.265-301, 1997.
DOI : 10.1017/S0956796897002724

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

G. E. Blelloch and J. Greiner, Parallelism in sequential functional languages, Proceedings of the seventh international conference on Functional programming languages and computer architecture , FPCA '95, pp.226-237, 1995.
DOI : 10.1145/224164.224210
URL : http://www-2.cs.cmu.edu/%7Eguyb/papers/BG95.pdf

A. Charguéraud and F. Pottier, Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation, pp.137-153, 2015.
DOI : 10.1007/978-3-319-22102-1_9

H. Cirstea and C. Kirchner, The rewriting calculus - part I, Logic Journal of IGPL, vol.9, issue.3, pp.339-375, 2001.
DOI : 10.1093/jigpal/9.3.339
URL : https://hal.archives-ouvertes.fr/inria-00100531

D. Lago, U. Martini, and S. , Derivational complexity is an invariant cost model, pp.100-113, 2009.

D. Lago, U. Martini, and S. , On Constructor Rewrite Systems and the Lambda- Calculus, pp.163-174, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00909372

O. Danvy and I. Zerny, A synthetic operational account of call-by-need evaluation, Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP '13, pp.97-108, 2013.
DOI : 10.1145/2505879.2505898

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

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

C. B. Jay and D. Kesner, First-class patterns, Journal of Functional Programming, vol.9, issue.02, pp.191-225, 2009.
DOI : 10.1007/978-3-540-24754-8_20
URL : https://hal.archives-ouvertes.fr/hal-00524750

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

D. Kesner, The Theory of Calculi with Explicit Substitutions Revisited, pp.238-252, 2007.
DOI : 10.1007/978-3-540-74915-8_20
URL : https://hal.archives-ouvertes.fr/hal-00111285

J. W. Klop, V. Van-oostrom, and R. C. De-vrijer, Lambda calculus with patterns, Theoretical Computer Science, vol.398, issue.1-3, pp.1-3, 2008.
DOI : 10.1016/j.tcs.2008.01.019
URL : https://doi.org/10.1016/j.tcs.2008.01.019

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

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

R. Milner, Local Bigraphs and Confluence: Two Conjectures, Electronic Notes in Theoretical Computer Science, vol.175, issue.3, pp.65-73, 2007.
DOI : 10.1016/j.entcs.2006.07.035
URL : https://doi.org/10.1016/j.entcs.2006.07.035

B. C. Pierce, Types and Programming Languages, 2002.

D. Sands, J. Gustavsson, and A. Moran, Lambda Calculi and Linear Speedups, 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

I. Sergey, D. Vytiniotis, P. Jones, and S. L. , Modular, higher-order cardinality analysis in theory and practice, POPL '14, pp.335-348, 2014.

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.

D. Walker, Advanced Topics in Types and Programming Languages, chap. Substructural Type Systems, pp.3-43, 2004.

A. K. Wright and M. Felleisen, A Syntactic Approach to Type Soundness, Information and Computation, vol.115, issue.1, pp.38-94, 1994.
DOI : 10.1006/inco.1994.1093
URL : https://doi.org/10.1006/inco.1994.1093