Abstract
We prove the confluence and strong normalization properties for second order lambda calculus equipped with an expansive version of η-reduction. Our proof technique, based on a simple abstract lemma and a labelled λ-calculus, can also be successfully used to simplify the proofs of confluence and normalization for first order calculi, and can be applied to various extensions of the calculus presented here.
This work has been partially supported by grants from HCM “Typed Lambda Calculus” and CNR-CNRS projects
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Yohji Akama. On Mints' reductions for ccc-calculus. In Typed Lambda Calculus and Applications, number 664 in LNCS, pages 1–12. Springer Verlag, 1993.
Henk Barendregt. The Lambda Calculus; Its syntax and Semantics (revised edition). North Holland, 1984.
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, 1991.
Djordje Cubric. On free ccc. Distributed on the types mailing list, 1992.
Roberto Di Cosmo and Delia Kesner. Simulating expansions without expansions. Technical Report LIENS-93-11/INRIA 1911, LIENS-DMI and INRIA, 1993.
Roberto Di Cosmo and Delia Kesner. Modular properties of first order algebraic rewriting systems, recursion and extensional lambda calculi. In Intern. Conf. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science. Springer-Verlag, 1994.
Roberto Di Cosmo and Delia Kesner. Simulating expansions without expansions. Mathematical Structures in Computer Science, 1994. A preliminary version is available as Technical Report LIENS-93-11/INRIA 1911.
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.
Alfons Geser. Relative termination. PhD thesis, 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.
Colin Barry Jay and Neil Ghani. The virtues of eta-expansion. Technical Report ECS-LFCS-92-243,LFCS, 1992. University of Edimburgh.
Delia Kesner. La definition de fonctions par cas á l'aide de motifs dans des langages applicatifs. Thèse de doctoral, Université de Paris XI, Orsay, december 1993. To appear.
Gregory Mints. Teorija categorii i teoria dokazatelstv.I. Aktualnye problemy logiki i metodologii nauky, pages 252–278, 1979.
Dan Nesmith. An application of Klop's counterexample to a higher-order rewrite system. Draft Paper, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Cosmo, R., Pipemo, A. (1995). Expanding extensional polymorphism. 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/BFb0014050
Download citation
DOI: https://doi.org/10.1007/BFb0014050
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