Abstract
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to the polymorphic lambda calculus, as higher-order constants.
We show that if a many-sorted algebraic rewrite system R is strongly normalizing (terminating, noetherian), then R + β + η + type-β + type-η rewriting of mixed terms is also strongly normalizing. We obtain this results using a technique which generalizes Girard's “candidats de reductibilité”, introduced in the original proof of strong normalization for the polymorphic lambda calculus.
We also show that if a many-sorted algebraic rewrite system R has the Church-Rosser property (is confluent), then R + β + type-β + type-η rewriting of mixed terms has the Church-Rosser property too. Combining the two results, we conclude that if R is canonical (complete) on algebraic terms, then R + β + type-β + type-η is canonical on mixed terms.
η reduction does not commute with algebraic reduction, in general. However, using long η-normal forms, we show that if R is canonical then R + β + η + type-β + type-η convertibility is still decidable.
Partially supported by ONR Grant NOOO14-88-K-0634 and by ARO Grant DAAG29-84-K-0061
Partially supported by ONR Grant NOOO14-88-K-0593.
Preview
Unable to display preview. Download preview PDF.
References
V. Breazu-Tannen and T. Coquand. Extensional models for polymorphism. Theoretical Computer Science, 85–114, 1988.
V. Breazu-Tannen and A. R. Meyer. Computable values can be classical. In Proceedings of the 14th Symposium on Principles of Programming Languages, pages 238–245, ACM, January 1987.
V. Breazu-Tannen. Combining algebra and higher-order types. In Proceedings of the Symposium on Logic in Computer Science, pages 82–90, IEEE, July 1988.
T. Coquand and G. Huet. The calculus of constructions. Information and Control, 76:95–120, 1988.
D. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. Manuscript, Wesleyan University. March 1989.
H. Ehrig and B. Mahr. Fundamentals of algebraic specification 1: equations and initial semantics. Springer-Verlag, 1985.
J.-Y. Girard. Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieure. PhD thesis, Université Paris VII, 1972.
J. Y. Girard, Y. Lafont, and P. Taylor. Typed lambda calculus. Cambridge University Press, 1989. Forthcoming.
J. Gallier and W. Snyder. Complete sets of transformations for general E-Unification. Theoretical Computer Science, 1989. To appear.
J. Gallier and W. Snyder. Higher-order unification revisited: complete sets of transformations. Journal of Symbolic Computation, 1989. To appear.
J. W. Klop. Combinatory reduction systems. Tract 129, Mathematical Center, Amsterdam, 1980.
J. W. Klop. Term rewriting systems: a tutorial. Bull. EATCS, 32:143–182, June 1987.
J. Meseguer and J. Goguen. Deduction with many-sorted rewrite. Technical Report 42, CSLI, Stanford, 1985.
J. C. Mitchell. A type-inference approach to reduction properties and semantics of polymorphic expressions. In Proceedings of the LISP and Functional Programming Conference, pages 308–319, ACM, New York, August 1986.
A. R. Meyer and M. B. Reinhold. ‘Type’ is not a type: preliminary report. In Conf. Record Thirteenth Ann. Symp. Principles of Programming Languages, pages 287–295, ACM, January 1986.
R. Statman. Completeness, invariance and λ-definability. Journal of Symbolic Logic, 47:17–26, 1982.
R. Statman. Logical relations and the typed λ-calculus. Information and Control, 65:85–97, 1985.
W. W. Tait. Intensional interpretations of functionals of finite type i. Journal of Symbolic Logic, 32:198–212, 1967.
W. W. Tait. A realizability interpretation of the theoyr of species. In R. Parikh, editor, Proceedings of the Logic Colloqium '73, pages 240–251, Lecture Notes in Mathematics, Vol. 453, Springer-Verlag, 1975.
Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM, 34(1):128–143, January 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Breazu-Tannen, V., Gallier, J. (1989). Polymorphic rewriting conserves algebraic strong normalization and confluence. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035757
Download citation
DOI: https://doi.org/10.1007/BFb0035757
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51371-1
Online ISBN: 978-3-540-46201-9
eBook Packages: Springer Book Archive