ISBN:  Unavailable

Category: Unavailable

Page count: 32

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 + [beta] + [eta] + type-[beta] + type-[eta] rewriting of mixed terms is also strongly normalizing. We obtain this results [sic] using a technique which generalizes Girard's 'candidats de reductibilité', introduced in the original proof of strong normalization for the polymorphic lambda calculus.