A confluent reduction for the λ-calculus with surjective pairing and terminal object

  • Pierre-Louis Curien
  • Roberto Di Cosmo
Rewriting And Logic (Session 7)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 510)

Abstract

We exhibit confluent and effectively weakly normalizing (thus decidable) rewriting systems for the full equational theory underlying cartesian closed categories, and for polymorphic extensions of it. The λ-calculus extended with surjective pairing has been well-studied in the last two decades. It is not confluent in the untyped case, and confluent in the typed case. But to the best of our knowledge the present work is the first treatment of the lambda calculus extended with surjective pairing and terminal object via a confluent rewriting system, and is the first solution to the decidability problem of the full equational theory of Cartesian Closed Categories extended with polymorphic types. Our approach yields conservativity results as well. In separate papers we apply our results to the study of provable type isomorphisms, and to the decidability of equality in a typed λ-calculus with subtyping.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bar84]
    Henk Barendregt. The Lambda Calculus; Its syntax and Semantics (revised edition). North Holland, 1984.Google Scholar
  2. [BDCL90]
    Kim Bruce, Roberto Di Cosmo, and Giuseppe Longo. Provable isomorphisms of types. Technical Report 90–14, LIENS — Ecole Normale Supérieure, 1990. To appear in Proc. of Symposium on Symbolic Computation, ETH, Zurich, March 1990: MSCS.Google Scholar
  3. [CDC91]
    Pierre-Louis Curien and Roberto Di Cosmo. A confluent reduction system for the λ-calculus with surjective pairing and terminal object. Technical Report, LIENS — Ecole Normale Supérieure, 1991. To appear.Google Scholar
  4. [CG90]
    Pierre-Louis Curien and Giorgio Ghelli. Subtyping and extensionality: decidability of βηtop≤ on F≤. 1990. Draft.Google Scholar
  5. [DC91]
    Roberto Di Cosmo. Invertibility of terms and valid isomorphisms. A proof theoretic study on second order λ-calculus with surjective pairing and terminal object. Technical Report, LIENS — Ecole Normale Supérieure, 1991. To appear.Google Scholar
  6. [Dez76]
    Mariangiola Dezani-Ciancaglini. Characterization of normal forms possessing an inverse in the γβη calculus. Theoretical Computer Science, 2:323–337, 1976.Google Scholar
  7. [GLT90]
    Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge University Press, 1990.Google Scholar
  8. [Har89]
    Thérèse Hardin. Confluence results for the pure strong categorical logic C.C.L.; λ-calculi as subsystems of c.c.l. Theoretical Computer Science, 65(2):291–342, 1989.Google Scholar
  9. [Jay91]
    C. Barry Jay. Strong normalisation for simply-typed lambda-calculus as in lambek-scott. February 1991. LFCS, University of Edimburgh.Google Scholar
  10. [Klo80]
    Jan Wilhelm Klop. Combinatory reduction systems. Mathematical Center Tracts, 27, 1980.Google Scholar
  11. [LS86]
    Joachim Lambek and Philip J. Scott. An introduction to higher order categorical logic. Cambridge University Press, 1986.Google Scholar
  12. [Min]
    Gregory Mints. A simple proof of the coherence theorem for cartesian closed categories. Bibliopolis, to appear.Google Scholar
  13. [Nip90]
    Tobias Nipkow. A critical pair lemma for higher-order rewrite systems and its application to λ*. First Annual Workshop on Logical Frameworks, 1990.Google Scholar
  14. [Obt87]
    Adam Obtulowicz. Algebra of constructions I. The Word Problem for Partial Algebras. Information and Computation, 73(2):129–173, 1987.Google Scholar
  15. [Pot81]
    Garrel Pottinger. The Church Rosser Theorem for the Typed lambda-calculus with Surjective Pairing. Notre Dame Journal of Formal Logic, 22(3):264–268, 1981.Google Scholar
  16. [PV87]
    Axel Poigné and Josef Voss. On the implementation of abstract data types by programming language constructs. Journal of Computer and System Science, 34(2–3):340–376, April/June 1987.Google Scholar
  17. [Tai67]
    W.W. Tait. Intensional interpretation of functionals of finite type I. Journal of Symbolic Logic, 32, 1967.Google Scholar
  18. [Tro86]
    Ann S. Troelstra. Strong normalization for typed terms with surjective pairing. Notre Dame Journal of Formal Logic, 27(4), 1986.Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Pierre-Louis Curien
    • 1
  • Roberto Di Cosmo
    • 1
  1. 1.LIENS (CNRS URA 1347) and Dipartimento di InformaticaPisa

Personalised recommendations