On explicit substitutions and names (extended abstract)

  • Eike Ritter
  • Valeria de Paiva
Session 4: Semantics I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1256)


Calculi with explicit substitutions have found widespread acceptance as a basis for abstract machines for functional languages. In this paper we investigate the relations between variants with de Bruijnnumbers, with variable names, with reduction based on raw expressions and calculi with equational judgements. We show the equivalence between these variants, which is crucial in establishing the correspondence between the semantics of the calculus and its implementations.


Normal Form Free Variable Reduction Rule Abstract Machine Substitution Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1991.Google Scholar
  2. 2.
    R. Bloo and K.H. Rose. Preesrvation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. In Proc. CSN'95 — Computer Science in the Netherlands, pages 62–72, 1995.Google Scholar
  3. 3.
    C. Coquand. From semantics to rules: A machine assisted analysis. In CSL'93, volume 832 of LNCS, 1994.Google Scholar
  4. 4.
    P.-L. Curien, Th. Hardin, and J.-J. Lévy. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM, 43:362–397, March 1996.CrossRefGoogle Scholar
  5. 5.
    Pierre-Louis Curien, An abstract framework for environment machines (Note). Theoretical Computer Science, 82(2):389–402, 1991.CrossRefGoogle Scholar
  6. 6.
    Herman Geuvers. Logics and Type Systems. PhD thesis, Univ. of Nijmegen, 1993.Google Scholar
  7. 7.
    Thérèse Hardin. Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCL. Theoretical Computer Science, 65:291–342, 1989.CrossRefGoogle Scholar
  8. 8.
    F. Kamareddine and A. Rios. A lambda-calculus a la de bruijn with explicit substitutions. In PLILP'95, volume 982 of LNCS, 1995.Google Scholar
  9. 9.
    P. Lescanne. From λσ to λυ: a journey through calculi of explicit substitutions. POPL'94, pages 60–69, Portland, Oregon, 1994.Google Scholar
  10. 10.
    Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis, Napoli, 1984.Google Scholar
  11. 11.
    P.-A. Mellies. Typed λ-calculi with explicit substitution may not terminate. TLCA'95, pages 328–334. LNCS No. 902, 1995.Google Scholar
  12. 12.
    E. Ritter and V. de Paiva. On explicit substitution and names. Technical report, Univ. of Birmingham, School of Computer Science, 1997.Google Scholar
  13. 13.
    Eike Ritter. Normalization for typed lambda calculi with explicit substitution. CSL'93, pages 295–304. LNCS No. 832, 1994.Google Scholar
  14. 14.
    Thomas Streicher. Correctness and Completeness of a Categorical Semantics of the Calculus of Constructions. PhD thesis, Universität Passau, June 1989.Google Scholar
  15. 15.
    A. Tasistro. Formulation of Martin-Löf's theory types with explicit substitutions. Licenciate Thesis, Chalmers University, Dept. of Computer Science, May 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Eike Ritter
    • 1
  • Valeria de Paiva
    • 1
  1. 1.School of Computer ScienceUniversity of BirminghamUK

Personalised recommendations