Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1997: Automata, Languages and Programming pp 237–247Cite as

On modular properties of higher order extensional lambda calculi

  • Session 4: Semantics I
  • Conference paper
  • First Online:

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

Abstract

We prove that confluence and strong normalisation are both modular properties for the addition of algebraic term rewriting systems to Girard's F ω equipped with either β-equality or βη-equality.

The key innovation is the use of η-expansions over the more traditional η-contractions. We then discuss the difficulties encountered in generalising these results to type theories with dependent types. Here confluence remains modular, but results concerning strong normalisation await further basic research into the use of η-expansions in dependent type theory.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Akama. On Mints' reductions for ccc-Calculus. In Typed Lambda Calculus and Applications, number 664 in LNCS, pages 1–12. Springer Verlag, 1993.

    Google Scholar 

  2. F. Barbanera. Combining term-rewriting and type-assignment systems. In Third Italian Conference on Theoretical Computer Science, Mantova, 1989. World Scientific Publishing Company.

    Google Scholar 

  3. F. Barbanera. Combining term rewriting and type assignment systems. Int. Journal of Found. of Comp. Science, 1:165–184, 1990.

    Article  Google Scholar 

  4. F. Barbanera and M. Fernandez. Intersection type assignment systems with higher-order algebraic rewriting. Theoretical Computer Science. To appear.

    Google Scholar 

  5. F. Barbanera and M. Fernandez. Modularity of termination and confluence in combinations of rewrite systems with λ ω . In A.Lingas, R.Karlsson, and S.Carlsson, editors, Intern. Conf. on Automata, Languages and Programming (ICALP), number 700 in Lecture Notes in Computer Science, Lund, 1993.

    Google Scholar 

  6. F. Barbanera and M. Fernandez. Modularity of termination and confluence in combinations of rewrite systems with the typed lambda-calculus of order omega. Technical report, Universit Paris Sud, 1994.

    Google Scholar 

  7. F. Barbanera, M. Fernandez, and H. Geuvers. Modularity of strong normalization and confluence in the algebraic-λ-cube. In Proceedings of the Symposium on Logic in Computer Science (LICS), Paris, 1994. IEEE Computer Society Press.

    Google Scholar 

  8. H. Barendregt. The Lambda Calculus; Its syntax and Semantics (revised edition). North Holland, 1984.

    Google Scholar 

  9. V. Breazu-Tannen. Combining algebra and higher order types. In IEEE, editor, Proceedings of the Symposium on Logic in Computer Science (LICS), pages 82–90, July 1988.

    Google Scholar 

  10. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting preserves algebraic strong normalization. Theoretical Computer Science, 83:3–28, 1991.

    Article  Google Scholar 

  11. V. Breazu-Tannen and J. Gallier. Polymorphic rewiting preserves algebraic confluence. Information and Computation. 114:1–29, 1994.

    Google Scholar 

  12. T. Coquand and G. Huet. Constructions: a higher-order proof system for mechanizing mathematics. EUROCAL85 in LNCS 203, 1985.

    Google Scholar 

  13. D. Cubric. On free CCC. Distributed on the types mailing list, 1992.

    Google Scholar 

  14. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. Van Leeuwen, editor, Handbook of theoretical computer science, volume Vol. B: Formal Models and Semantics, chapter 6, pages 243–320. The MIT Press, 1990.

    Google Scholar 

  15. R. Di Cosmo. A brief history of rewriting with extensionality. In Kluwer, editor, Proceedings ofthe 1996 Glasgow Summer School, 1996. To appear. A set of slides is availables from http://www.dmi.ens.fr/∼dicsmo.

    Google Scholar 

  16. R. Di Cosmo and D. Kesner. Simulating expansions without expansions. Mathematical Structures in Computer Science. 4:1–48, 1994. A preliminary version is available as Technical Report LIENS-93-11/INRIA 1911.

    Google Scholar 

  17. R. Di Cosmo and D, Kesner. Combining algebraic rewriting, extensional lambda calculi and fixpoints. Theoretical Computer Science, 1995. To appear.

    Google Scholar 

  18. D. J. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. Information and Computation, 101(2):251–267, Dec. 1992.

    Google Scholar 

  19. D. J. Dougherty. Some lambda calculi with categorícal sums and products. In Proc. of the Fifth International Conference on Rewriting Techniques and Applications (RTA), 1993.

    Google Scholar 

  20. G. Dowek,G. Huet, and B. Werner. On the definition of the eta-long normal form in the type systems of the cube. In Informal Proceedings of the Workshop “Types”, Nijmegen, 1993.

    Google Scholar 

  21. J. Gallier. On Girard's “Candidats de Reductibilité”, pages 123–203. Logic and Computer Science. Academic Press, 1990. Odifreddi, editor.

    Google Scholar 

  22. N. Ghani. Eta-expansions in dependent type theory — the calculus of constructions. In Proceedings, TLCA 97 LNCS 1210, Nancy, France 1997. Eds de Groote and JR Hindley

    Google Scholar 

  23. N. Ghani. Eta-expansions in F ω. Presented at CSL'96 Utrecht Holland. To appear in CSL'96 proceedings.

    Google Scholar 

  24. N. Ghani. βη-equality for coproducts. In M. Dezani-Ciancaglini and G. Plotkin, editors, Typed Lambda Calculus and Applications, volume 902 of Lecture Notes in Computer Science, Apr. 1995.

    Google Scholar 

  25. N. Ghani. Extensionality and polymorphism. University of Edimburgh, Submitted, 1995.

    Google Scholar 

  26. B. Howard and J. Mitchell. Operational and axiomatic semantics of pcf. In Proceedings of the LISP and Functional Programming Conference, pages 298–306. ACM, 1990.

    Google Scholar 

  27. C. B. Jay and N. Ghani. The Virtues of Eta-expansion. Technical Report ECS-LFCS-92-243, LFCS, 1992. University of Edimburgh. preliminary version of [28].

    Google Scholar 

  28. C. B. Jay and N. Ghani. The Virtues of Eta-expansion. Journal of Functional Programming, 5(2):135–154, Apr. 1995.

    Google Scholar 

  29. J.-P. Jouannaud and M. Okada. A computation model for executable higher-order algebraic specification languages. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 350–361, Amsterdam, The Netherlands, 15–18 July 1991. IEEE Computer Society Press.

    Google Scholar 

  30. G. Mints. Teorija categorii i teoria dokazatelstv.I. Aktualnye problemy logiki i metodologii nauky, pages 252–278, 1979.

    Google Scholar 

  31. V. van Oostrom. Developing developments. Submitted to Theoretical Computer Science should appear in volume 145, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DMI-LIENS (CNRS URA 1327), Ecole Normale Supérieure, 45, Rue d'Ulm, 75230, Paris, France

    Roberto Di Cosmo & Neil Ghani

Authors
  1. Roberto Di Cosmo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Neil Ghani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Cosmo, R., Ghani, N. (1997). On modular properties of higher order extensional lambda calculi. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_181

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_181

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

  • Online ISBN: 978-3-540-69194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation