Skip to main content

An explicit Eta rewrite rule

  • Conference paper
  • First Online:
Book cover Typed Lambda Calculi and Applications (TLCA 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 902))

Included in the following conference series:

Abstract

In this paper, we extend λ-calculi of explicit substitutions by an Eta rule. The previous definition of Eta is due to Hardin (1992) and Ríos (1993). Their definition is a conditional rewrite rule and does not stick fully to the philosophy of explicit substitutions. Our main result is making the η-contraction explicit by means of an unconditional, generic Eta rewrite rule and of an extension of the substitution calculus. We do this in the framework of λυ, a calculus introduced by Lescanne (1994). We prove the correction, confluence and strong normalization (on typed terms) of λυη. We also show how this explicit Eta leads to η′, a very general alternative to the classical η, that allows confluent contractions not captured by η.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. H. P. Barendregt. The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, 1984. Second edition.

    Google Scholar 

  3. Z. Benaissa, D. Briaud, P. Lescanne, and J. Rouyer-Degli. λυ, a calculus of explicit substitutions which preserves strong normalisation. Submitted, December 1994.

    Google Scholar 

  4. D. Briaud. An explicit Eta rewrite rule. Rapport de Recherche 2417, INRIA, 1994.

    Google Scholar 

  5. H. B. Curry and Feys. Combinatory Logic, volume 1. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, 1958.

    Google Scholar 

  6. P.-L. Curien. Combinateurs catégoriques, algorithmes séquentiels et programmation applicative. Thése de Doctorat d'Etat, Univ. Paris 7, 1983.

    Google Scholar 

  7. P.-L. Curien. Categorical combinators. Information and Control, 69:188–254, 1986.

    Article  Google Scholar 

  8. P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman, 1986.

    Google Scholar 

  9. N. G. de Bruijn, Lambda calculus with nameless dummies, a tool for automatic formula manipulation. Indag. Mat., 34:381–392, 1972.

    Google Scholar 

  10. N. G. de Bruijn. A namefree lambda calculus with facilities for internal definition of expressions and segments. TH-Repoft 78-WSK-03, Technological University Eindhoven, Netherlands, Department of Math., 1978.

    Google Scholar 

  11. Th. Hardin. Résultats de confluence pour les régies fortes de la logique combinatoire catégorique et liens avec les lambda-calculs. Thése de Doctorat d'Etat, Univ. Paris 7, 1987.

    Google Scholar 

  12. Th. Hardin. Confluence results for the pure strong categorical combinatory logic CCL: λ-calculi as subsystems of CCL. In TCS, 65:291–342, 1989.

    Article  Google Scholar 

  13. Th. Hardin. Eta-conversion for the languages of explicit substitutions. In 3rd ALP, LNCS 632, Volterra, Italy, 1992.

    Google Scholar 

  14. Th. Hardin and J.-J. Levy. A confluent calculus of substitutions. In France-Japan Artificial Intelligence and Computer Science Symposium, Izu, 1989.

    Google Scholar 

  15. J. Roger Hindley and Johnathan P. Seldin. Introduction to Combinators and Lambda-calculus. Cambridge University, 1986.

    Google Scholar 

  16. J.-P. Jouannaud and Claude Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257–321. The MIT press, Cambridge (MA, USA), 1991.

    Google Scholar 

  17. P. Lescanne. From λσ to λυ, a journey through calculi of explicit substitutions. In 21st POPL, Portland (Or., USA), pages 60–69. ACM, 1994.

    Google Scholar 

  18. P. Lescanne and J. Rouyer-Degli. The calculus of explicit substitutions λυ. Technical Report RR-2222, INRIA-Lorraine, January 1994.

    Google Scholar 

  19. P. Lescanne and J. Rouyer-Degli. Explicit substitutions with de Bruijn's levels, August 1994.

    Google Scholar 

  20. P.-A. Melliés. Typed λ-calculi with explicit substitutions may not terminate. In M. Dezani, editor, TLCA, 1995.

    Google Scholar 

  21. A. Rios. Contributions á l'étude des λ-calculs avec des substitutions explicites. Thése de Doctorat d'Université, U. Paris VII, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mariangiola Dezani-Ciancaglini Gordon Plotkin

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Briaud, D. (1995). An explicit Eta rewrite rule. In: Dezani-Ciancaglini, M., Plotkin, G. (eds) Typed Lambda Calculi and Applications. TLCA 1995. Lecture Notes in Computer Science, vol 902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014047

Download citation

  • DOI: https://doi.org/10.1007/BFb0014047

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59048-4

  • Online ISBN: 978-3-540-49178-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics