Skip to main content
SpringerLink
Log in

Rewriting with extensional polymorphic λ-calculus

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1995)

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

Included in the following conference series:

Abstract

We provide a confluent and strongly normalizing rewriting system, based on expansion rules, for the extensional second order typed lambda calculus with product and unit types: this system corresponds to the Intuitionistic Positive Calculus with implication, conjunction, quantification over proposition and the constant True. This result is an important step towards a new theory of reduction based on expansion rules, and gives a natural interpretation to the notion of second order η-long normal forms used in higher order resolution and unification, that are here just the normal forms of our reduction 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. Yohji 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. Henk Barendregt. The Lambda Calculus; Its syntax and Semantics (revised edition). North Holland, 1984.

    Google Scholar 

  3. Val Breazu-Tannen, Combining algebra and higher-order types. In Proceedings, Third Annual Symposium on Logic in Computer Science, pages 82–90, Edinburgh, Scotland, July 5–8 1988. IEEE Computer Society.

    Google Scholar 

  4. Val Breazu-Tannen and Jean Gallier. Polymorphic rewiting preserves algebraic confluence. Information and Computation, 114:1–29, 1994.

    Google Scholar 

  5. Val Breazu-Tannen and Albert R. Meyer. Polymorphism is conservative over simple types (preliminary report). In Proceedings, Symposium on Logic in Computer Science, pages 7–17, Cambridge, Massachusetts, June 16–18 1986. IEEE Computer Society.

    Google Scholar 

  6. Pierre-Louis Curien and Roberto Di Cosmo. A confluent reduction system for the λ-calculus with surjective pairing and terminal object. In Leach, Monien, and Artalejo, editors, Intern. Conf. on Automata, Languages and Programming (ICALP), volume 510 of Lecture Notes in Computer Science, pages 291–302. Springer-Verlag, July 1991.

    Google Scholar 

  7. Djordje Cubric. On free CCC. Distributed on the types mailing list, 1992.

    Google Scholar 

  8. Roberto Di Cosmo and Delia Kesner. Combining first order algebraic rewriting systems, recursion and extensional lambda calculi. In Serge Abite-boul and Eli Shamir, editors, Intern. Conf. on Automata, Languages and Programming (ICALP), volume 820 of Lecture Notes in Computer Science, pages 462–472. Springer-Verlag, July 1994.

    Google Scholar 

  9. Roberto Di Cosmo and Delia 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 

  10. Roberto Di Cosmo and Adolfo Piperno. Expanding extensional polymorphism. In Mariangiola Dezani-Ciancaglini and Gordon Plotkin, editors, Typed Lambda Calculus and Applications, volume 902 of Lecture Notes in Computer Science, pages 139–153, April 1995.

    Google Scholar 

  11. Daniel J. Dougherty. Some lambda calculi with categorical sums and products. In Proc, of the Fifth International Conference on Rewriting Techniques and Applications (RTA), 1993.

    Google Scholar 

  12. Alfons Geser. Relative termination. Dissertation, Fakultät für Mathematik und Informatik, Universität Passau, Germany, 1990. Also available as: Report 91-03, Ulmer Informatik-Berichte, Universität Ulm, 1991.

    Google Scholar 

  13. Herman Geuvers. The church-rosser property for βη-reduction in typed λ-calculi. In 7th Proceedings of the Symposium on Logic in Computer Science (LICS), pages 453–460, 1992.

    Google Scholar 

  14. Neil Ghani. Extensionality and polymorphism. University of Edimburgh, Submitted, 1995.

    Google Scholar 

  15. Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge University Press, 1990.

    Google Scholar 

  16. Colin Barry Jay. Long βη normal forms and confluence (revised). Technical Report 44, LFCS — University of Edinburgh, August 1992.

    Google Scholar 

  17. Colin Barry Jay and Neil Ghani. The Virtues of Eta-expansion. Technical Report ECS-LFCS-92-243, LFCS, 1992. University of Edimburgh, preliminary version of [JG95].

    Google Scholar 

  18. Colin Barry Jay and Neil Ghani. The Virtues of Eta-expansion. Journal of Functional Programming, 5(2):135–154, April 1995.

    Google Scholar 

  19. Jean-Pierre Jouannaud and Mitsuhiro 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, July 15–18 1991. IEEE Computer Society Press.

    Google Scholar 

  20. Jan Willem Klop. Combinatory reduction systems. Mathematical Center Tracts, 27, 1980.

    Google Scholar 

  21. Tobias Nipkow. A critical pair lemma for higher-order rewrite systems and its application to λ*. First Annual Workshop on Logical Frameworks, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Roberto Di Cosmo

  2. CNRS and LRI, Université de Paris-Sud, Bât 490, 91405, Orsay Cedex, France

    Delia Kesner

Authors
  1. Roberto Di Cosmo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Delia Kesner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Kleine Büning

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Cosmo, R., Kesner, D. (1996). Rewriting with extensional polymorphic λ-calculus. In: Kleine Büning, H. (eds) Computer Science Logic. CSL 1995. Lecture Notes in Computer Science, vol 1092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61377-3_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-61377-3_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61377-0

  • Online ISBN: 978-3-540-68507-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation