B. Accattoli, An abstract factorisation theorem for explicit substitutions, 2011.

B. Accattoli, Jumping around the box, 2011.

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

B. Accattoli and D. Kesner, The Permutative ??-Calculus, LPAR-18 2012, pp.23-36, 2012.
DOI : 10.1007/978-3-642-28717-6_5
URL : https://hal.archives-ouvertes.fr/hal-00780361

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

B. Accattoli and L. Paolini, Call-by-value solvability, revisited (ext. version) (2012), https

H. P. Barendregt, The Lambda Calculus ? Its Syntax and Semantics, 1984.

H. Barendregt, Solvability in lambda-calculi, The Journal of Symbolic Logic, vol.39, issue.2, p.372, 1975.

R. Dyckhoff and S. Lengrand, Call-by-Value ??-calculus and LJQ, Journal of Logic and Computation, vol.17, issue.6, pp.1109-1134, 2007.
DOI : 10.1093/logcom/exm037
URL : https://hal.archives-ouvertes.fr/hal-00150284

M. Fernández and N. Siafakas, Labelled Lambda-calculi with Explicit Copy and Erase, Electronic Proceedings in Theoretical Computer Science, vol.22, pp.49-64, 2009.
DOI : 10.4204/EPTCS.22.5

H. Herbelin and S. Zimmermann, An Operational Account of Call-by-Value Minimal and Classical ??-Calculus in ???Natural Deduction??? Form, TLCA 2009, pp.142-156, 2009.
DOI : 10.2307/2694930
URL : https://hal.archives-ouvertes.fr/inria-00389903

M. Hofmann, Sound and complete axiomatisations of call-by-value control operators, Mathematical Structures in Computer Science, vol.10, issue.04, pp.461-482, 1995.
DOI : 10.1007/BF01019462

J. M. Hyland, A Survey of Some Useful Partial Order Relations on Terms of the Lambda Calculus) ?-Calculus and Computer Science Theory, LNCS, vol.37, pp.83-95, 1975.

J. W. Klop, On Solvability by ? I -Terms) ?-Calculus and Computer Science Theory, LNCS, vol.37, pp.342-345, 1975.

P. J. Landin, A correspondence between ALGOL 60 and Church's Lambda-notations: Part II, Communications of the ACM, vol.8, issue.3, pp.89-101, 1965.
DOI : 10.1145/363791.363804

P. A. Mellì-es, A Factorisation Theorem in Rewriting Theory, CTCS 1997, pp.49-68, 1997.

E. Moggi, Computational lambda-calculus and monads, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.14-23, 1989.
DOI : 10.1109/LICS.1989.39155

M. Pagani and S. R. Rocca, Linearity, non-determinism and solvability, Fundam. Inform, vol.103, issue.1-4, pp.173-202, 2010.

L. Paolini, Call-by-Value Separability and Computability, ICTCS 2001, pp.74-89, 2001.
DOI : 10.1007/3-540-45446-2_5

L. Paolini, E. Pimentel, and S. Ronchi-della-rocca, Lazy Strong Normalization, Electronic Notes in Theoretical Computer Science, vol.136, pp.103-116, 2005.
DOI : 10.1016/j.entcs.2005.06.013

L. Paolini and S. Ronchi-della-rocca, Call-by-value Solvability, RAIRO - Theoretical Informatics and Applications, vol.33, issue.6, pp.507-534, 1999.
DOI : 10.1051/ita:1999130
URL : https://hal.archives-ouvertes.fr/hal-00780358

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

R. Della-rocca, S. Paolini, and L. , The Parametric ?-Calculus: a Metamodel for Computation . Texts in Theoretical Computer Science: An EATCS, 2004.

A. Sabry and M. Felleisen, Reasoning about programs in continuation-passing style, LISP and Symbolic Computation, vol.21, issue.12, pp.289-360, 1993.
DOI : 10.1007/BF01019462

A. Saurin, Standardization and Böhm Trees for ??-Calculus, FLOPS 2010, pp.134-149, 2010.

C. P. Wadsworth, The Relation between Computational and Denotational Properties for Scott???s ${\text{D}}_\infty $-Models of the Lambda-Calculus, SIAM Journal on Computing, vol.5, issue.3, pp.488-521, 1976.
DOI : 10.1137/0205036