L. Abadi, P. L. Cardelli, J. J. Curien, and . Levy, Explicit substitutions, Journal of Functional Programming, vol.1, pp.31-46, 1991.
DOI : 10.1145/96709.96712
URL : https://hal.archives-ouvertes.fr/inria-00075382

. Accattoli, Jumping around the box: graphical and operational studies on Lambda Calculus and Linear Logic, 2011.

U. Accattoli and . Dal-lago, On the invariance of the unitary cost model for head reduction (long version) Available at http

S. Accattoli and . Guerrini, Jumping Boxes, Proceedings of CSL 2009, pp.55-70, 2009.
DOI : 10.1142/9789812815149_0001

D. Accattoli and . Kesner, The Structural ??-Calculus, Proceedings of CSL 2010, pp.381-395, 2010.
DOI : 10.1007/978-3-642-15205-4_30
URL : https://hal.archives-ouvertes.fr/hal-00528228

D. Accattoli and . Kesner, The permutative -calculus, 2012.
DOI : 10.1007/978-3-642-28717-6_5
URL : https://hal.archives-ouvertes.fr/hal-00780361

G. Avanzini and . Moser, Complexity Analysis by Graph Rewriting, Proceedings of FLOPS 2010, pp.257-271, 2010.
DOI : 10.1007/978-3-642-12251-4_19

M. Avanzini and G. Moser, Closing the gap between runtime complexity and polytime computability, Proceedings of RTA 2010 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.33-48, 2010.

D. Lago and S. Martini, The weak lambda calculus as a reasonable machine, Theoretical Computer Science, vol.398, issue.1-3, pp.32-50, 2008.
DOI : 10.1016/j.tcs.2008.01.044

D. Lago and S. Martini, On constructor rewrite systems and the lambda-calculus, Proceedings of ICALP 2009, pp.163-174, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00909372

D. Lago and S. Martini, Derivational complexity is an invariant cost model, Proceedings of FOPARA 2010, pp.88-101, 2010.

L. Danos and . Regnier, Head linear reduction, 2004.

M. Mascari and . Pedicini, Head linear reduction and pure proof net extraction, Proceedings of TLCA 1995, pp.111-137, 1994.
DOI : 10.1016/0304-3975(94)90263-1
URL : http://doi.org/10.1016/0304-3975(94)90263-1

.. Melliès, Axiomatic rewriting theory II: the ????-calculus enjoys finite normalisation cones, Journal of Logic and Computation, vol.10, issue.3, pp.461-487, 2000.
DOI : 10.1093/logcom/10.3.461

. Milner, Local bigraphs and confluence: Two conjectures: (extended abstract), ENTCS, vol.175, issue.3, pp.65-73, 2007.
DOI : 10.1016/j.entcs.2006.07.035
URL : http://doi.org/10.1016/j.entcs.2006.07.035

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

. Regnier, Lambda-calcul et réseaux, Thèse de doctorat, 1992.

J. Sands, A. Gustavsson, and . Moran, Lambda calculi and linear speedups In The Essence of Computation: Complexity, Analysis, Transformation, Essays Dedicated to Neil D. Jones, number 2566 in LNCS, pp.60-82, 2002.

. Terui, Light affine lambda calculus and polynomial time strong normalization, Archive for Mathematical Logic, vol.98, issue.1, pp.253-280, 2007.
DOI : 10.1007/s00153-007-0042-6

. Van-emde and . Boas, Machine Models and Simulations, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), pp.1-66, 1990.
DOI : 10.1016/B978-0-444-88071-0.50006-0