Skip to main content
SpringerLink
Log in

A proof of weak termination of typed λσ-calculi

  • Conference paper
  • First Online:
Types for Proofs and Programs (TYPES 1996)

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

Included in the following conference series:

Abstract

We show that reducing any simply-typed λσ-term (resp. λσ⇑) by applying the rules in σ (resp. σ⇑) eagerly always terminates, by a translation to the simply-typed λ-calculus. This holds even with term and substitution meta-variables. In fact, every reduction terminates provided that (β)-redexes are only contracted under so-called safe contexts; and in σ, resp. σ⇑-normal forms, all contexts around terms of sort T are safe. The result is then extended to λτ and a simple secondorder type system.

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

Access this chapter

Log in via an institution

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. In 17th PoPL, pages 31–46, 1990.

    Google Scholar 

  2. D. Briaud. Higher-order unification as a typed narrowing. Technical Report 96-R-112, CRIN, 1996.

    Google Scholar 

  3. R. Di Cosmo and D. Kesner. Strong normalization of explicit substitutions via cut elimination in proof nets (extended abstract). In 12th LICS, 1997.

    Google Scholar 

  4. G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions (extended abstract). In 10th LICS, pages 366–374, 1995.

    Google Scholar 

  5. J. H. Gallier. On Girard's “candidats de réductibilité”. In P. Odifreddi, editor, Logic and Computer Science, volume 31 of APIC Series, pages 123–203. Academic Press, 1990.

    Google Scholar 

  6. T. Hardin and J.-J. Lévy. A confluent calculus of substitutions. In France-Japan Artificial Intelligence and Computer Science Symposium, 1989.

    Google Scholar 

  7. J.-L. Krivine. Lambda-calcul, types et modèles. Masson, 1992.

    Google Scholar 

  8. P. Lescanne. τ does not terminate. Working group of the PRC Math-Info “Mélanges de systèmes de réécriture algébrique et de systèmes logiques”, 1996.

    Google Scholar 

  9. P. Lescanne and J. Rouyer-Degli. From λσ to λρ: a journey through calculi of explicit substitutions. In 21st PoPL, 1994.

    Google Scholar 

  10. P.-A. Melliès. Typed lambda-calculi with explicit substitutions may not terminate. In CONFER workshop, 1994.

    Google Scholar 

  11. P.-A. Melliès. Typed lambda-calculi with explicit substitutions may not terminate. In 2nd TLCA, pages 328–334. Springer Verlag LNCS 902, 1995.

    Google Scholar 

  12. C. A. Muñoz Hurtado. Confluence and preservation of strong normalization in an explicit substitutions calculus. In 11th LICS, 1996.

    Google Scholar 

  13. C. A. Muñoz Hurtado. Dependent types with explicit substitutions: A meta-theoretical development. In TYPES'96, 1997. This volume.

    Google Scholar 

  14. C. A. Muñoz Hurtado. Meta-theoretical properties of λφ: A left-linear variant of λσ. Technical Report RR-3107, Inria, 1997.

    Google Scholar 

  15. A. Ríos. Contributions à l'étude des lambda-calculus avec substitutions explicites. PhD thesis, École Normale Supérieure, 1993.

    Google Scholar 

  16. H. Zantema. Termination of term rewriting: Interpretation and type elimination. J. Symbolic Computation, 17:23–50, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Authors
  1. Jean Goubault-Larrecq
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eduardo Giménez Christine Paulin-Mohring

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goubault-Larrecq, J. (1998). A proof of weak termination of typed λσ-calculi. In: Giménez, E., Paulin-Mohring, C. (eds) Types for Proofs and Programs. TYPES 1996. Lecture Notes in Computer Science, vol 1512. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097790

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65137-6

  • Online ISBN: 978-3-540-49562-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation