1. Abadi, M., Cardelli, L., Curien, P.-L., and Lévy, J.-J. (1991). Explicit substitutions. Journal of Functional Programming, 1 (4): 375–416.
2. Barendregt, H. P. (1984). The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics. Elsevier Science Publishers B. V. ( North-Holland), Amsterdam. Second edition.
3. Benaissa, Z., Briaud, D., Lescanne, P., and Rouyer-Degli, J. (1996). Av, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming, 6 (5): 699–722.
4. Bloo, R. and Geuvers, J. H. (1999). Explicit substitution: on the edge of strong normalization. Theoretical Computer Science, 211: 375–395.
5. Bloo, R. and Rose, K. H. (1995). Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. In CSN ’85—Computing Science in the Netherlands, pages 62–72, Koninklijke Jaarbeurs, Utrecht.