Adding algebraic rewriting to the untyped lambda calculus (1992)
| Venue: | Information and Computation |
| Citations: | 21 - 0 self |
BibTeX
@ARTICLE{Dougherty92addingalgebraic,
author = {Daniel J. Dougherty},
title = {Adding algebraic rewriting to the untyped lambda calculus},
journal = {Information and Computation},
year = {1992},
volume = {101},
pages = {37--48}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We investigate the system obtained by adding an algebraic rewriting system R to an untyped lambda calculus in which terms are formed using the function symbols from R as constants. On certain classes of terms, called here "stable", we prove that the resulting calculus is confluent if R is confluent, and terminating if R is terminating. The termination result has the corresponding theorems for several typed calculi as corollaries. The proof of the confluence result suggests a general method for proving confluence of typed β reduction plus rewriting; we sketch the application to the polymorphic lambda calculus.
