E. Astesiano and G. Costa, Languages with reducing reflexive types, 7th Coll. on Automata , Languages and Programming, pp.38-50, 1980.
DOI : 10.1007/3-540-10003-2_58

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

H. P. Barendregt, J. R. Kennaway, J. W. Klop, and M. R. Sleep, Needed reduction and spine strategies for the lambda calculus [4] P. Crégut. An abstract machine for the normalization of ?-terms, Proc. of the ACM Conf. on Lisp and Functional Programming, pp.191-231, 1987.

M. J. Fischer, Lambda-calculus schemata, Proc. of the ACM Conf. on Proving Properties about Programs, Sigplan Notices, pp.104-109, 1972.
DOI : 10.1007/bf01019461
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.8355

P. Fradet and D. L. Métayer, Compilation of functional languages by program transformation, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.21-51, 1991.
DOI : 10.1145/114005.102805
URL : https://hal.archives-ouvertes.fr/inria-00075518

G. S. Frandsen and C. Sturtivant, What is an efficient implementation of the ??-calculus?, Proc. of the ACM Conf. on Functional Prog. Languages and Comp. Arch. Transformations and reduction strategies for typed lambda expressions, pp.289-312, 1991.
DOI : 10.1007/3540543961_14

R. J. Hughes, Supercombinators, a new implementation method for applicative languages, Proc. of the ACM Conf. on Lisp and Functional Programming, pp.603-631, 1982.

D. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin et al., Orbit, proc. of 1986 ACM SIGPLAN Symp. on Comp. Construction, pp.219-233, 1986.
DOI : 10.1145/989393.989414

J. Lamping, An algorithm for optimal lambda calculus reduction, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.16-30, 1990.
DOI : 10.1145/96709.96711
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.2386

J. Lévy, Réductions correctes et optimales dans le lambda calcul, Thèse de doctorat d'état, 1978.

G. Nadathur and D. S. Wilson, A representation of Lambda terms suitable for operations on their intensions, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.341-348, 1990.
DOI : 10.1145/91556.91682

G. Nadathur and D. Miller, An overview of ?Prolog, Proc. of the 5th Int. Conf. on Logic Prog, pp.810-827, 1988.

G. D. Plotkin, Call-by-name, call-by-value and the ?-calculus. Theoretical Computer Science, pp.125-159, 1975.

J. Staples, A graph-like lambda calculus for which leftmost-outermost reduction is optimal, Graph Grammars and their Application, pp.440-455, 1978.
DOI : 10.1007/BFb0025740

C. P. Wadsworth, Semantics and Pragmatics of the Lambda-Calculus, 1971.