1. Abadi, M., Cardelli, L., Curien, P.-L. and Lévy, J.-J.: Explicit substitutions, J. Funct. Programming 1(4) (1991), 375?416.
2. Aiello, L. and Prini, G.: An efficient interpreter for the lambda-calculus, J. Comput. System Sci. 23 (1981), 383?425.
3. Appel, A. and Shao, Z.: Smartest recompilation, in Tenth Annual ACM SIGPLAN?SIGACT Symposium on Principles of Programming Languages, January 1993, Longer version as Princeton University Technical Report CS-TR-395-92.
4. Benaissa, Z., Briaud, D., Lescanne, P. and Rouyer-Degli, J.: ??, a calculus of explicit substitutions which preserves strong normalization, J. Funct. Programming 6(5) (1996), 699?722.
5. Brisset, P. and Ridoux, O.: Naive reverse can be linear, in K. Furukawa (ed.), Eighth International Logic Programming Conference, MIT Press, June 1991, pp. 857?870.