1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit Substitutions. Journal of Functional Programming, to appear.
2. P.-L. Curien, T. Hardin, and J.-J. Lévy. Confluence properties of weak and strong calculi of explicit substitutions. 1991. Submitted.
3. P.-L. Curien, T. Hardin, and A. Ríos. Normalisation Forte du Calcul des Substitutions. Technical Report, LIENS-Ecole Normale Supérieure, 1991.
4. P.-L. Curien. Categorical Combinators, Sequential Algotithms and Computer Science. Pitman, 1986.
5. T. Hardin. Confluence Results for the Pure Strong Categorical Logic CCL: λ-calculi as Subsystems of CCL. Theoretical Computer Science, 65(2), 1989.