Polymorphic Rewriting Conserves Algebraic Strong Normalization

Loading...
Thumbnail Image
Penn collection
Technical Reports (CIS)
General Robotics, Automation, Sensing and Perception Laboratory
Degree type
Discipline
Subject
GRASP
Funder
Grant number
License
Copyright date
Distributor
Related resources
Contributor
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-η 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.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1990-06-01
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-90-36.
Recommended citation
Collection