• [ACCL91] M. Abadi and L. Cardelli and P.-L. Curien and J.-J. Lévy, Explicit Substitutions , Journal of Functional Programming, 1(4):375-416, 1991.

  • [KR97] F. Kamareddine and A. Ríos, Extending a lambda calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms , Journal of Functional Programming, 7(4):395-420, 1997.

  • [NAD99] G. Nadathur, A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations , Journal of Functional and Logic Programming, 1999(2):1-62, 1999.

  • [NQ03] G. Nadathur and X. Qi, Explicit Substitutions in the Reduction of Lambda Terms, Appears in Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming, pages 195-206, 2003.
    Last modification: 04/04/2006.