Polymorphic Rewriting Conserves Algebraic Confluence

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 has the Church-Rosser property (is confluent), then R + β + type-β + type-η rewriting of mixed terms has the Church-Rosser property too. η reduction does not commute with algebraic reduction, in general. However, using long normal forms, we show that if R is canonical (confluent and strongly normalizing) then equational provability from R + β + η + type-β + type-η is still decidable.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1992
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-37. Revised: January 1992
Recommended citation
Collection