Sciweavers

Share
LOPSTR
2004
Springer

Natural Rewriting for General Term Rewriting Systems

9 years 20 days ago
Natural Rewriting for General Term Rewriting Systems
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the most efficient of all being the natural rewriting strategy [9]. All the strategies so far, including natural rewriting, assume that the given term rewriting system is a left-linear constructor system. Although these restrictions are reasonable for some functional programming languages, they limit the expressive power of equational languages, and they preclude certain applications of rewriting to equational theorem proving and to languages combining equational and logic programming. In this paper, we propose a conservative generalization of natural rewriting that does not require the rules to be left-linear and constructor-based. We also establish the soundness and completeness of this generalization.
Santiago Escobar, José Meseguer, Prasanna T
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where LOPSTR
Authors Santiago Escobar, José Meseguer, Prasanna Thati
Comments (0)
books