1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1991.
2. A. W. Appel and A. P. Felty. Lightweight lemmas in λProlog. In International Conference on Logic Programming, pages 411–425. MIT Press, November 1999.
3. P. Brisset and O. Ridoux. Naive reverse can be linear. In K. Furukawa, editor, Eighth International Logic Programming Conference, pages 857–870. MIT Press, June 1991.
4. P. Brisset and O. Ridoux. The compilation of λProlog and its execution with MALI. Publication Interne 687, IRISA, 1992.
5. G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions. Information and Computation, 157:183–235, 2000.