Polymorphic Rewriting Conserves Algebraic Strong Normalization

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-η rewriting of mixed terms is also strongly normalizing. The result is obtained using a technique which generalizes Girard's "candidats de reductibilité", introduced in the original proof of strong normalization for the polymorphic lambda calculus. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-90-36. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/546 Polymorphic Rewriting Conserves Algebraic Strong Normalization MS-CIS-90-36 LOGIC & COMPUTATION 19 Val Breazu-Tannen Jean Gallier Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 19104-6389