Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Needed Narrowing Strategy Journal of the ACM, Volume 47, No. 4 (Jul. 2000) pp. 776-822
 

Summary: A Needed Narrowing Strategy
Journal of the ACM, Volume 47, No. 4 (Jul. 2000) pp. 776-822
SERGIO ANTOY
Portland State University, Portland, Oregon
RACHID ECHAHED
Laboratoire LEIBNIZ, Institut IMAG, Grenoble, France
MICHAEL HANUS
Christian-Albrechts-Universitat zu Kiel, Germany
Abstract: The narrowing relation over terms constitutes the basis of the most important op-
erational semantics of languages that integrate functional and logic programming paradigms. It
also plays an important role in the de nition of some algorithms of uni cation modulo equational
theories which are de ned by con uent term rewriting systems. Due to the ine∆ciency of simple
narrowing, many re ned narrowing strategies have been proposed in the last decade. This paper
presents a new narrowing strategy which is optimal in several respects. For this purpose we propose
a notion of a needed narrowing step that, for inductively sequential rewrite systems, extends the
Huet and Levy notion of a needed reduction step. We de ne a strategy, based on this notion,
that computes only needed narrowing steps. Our strategy is sound and complete for a large class
of rewrite systems, is optimal w.r.t. the cost measure that counts the number of distinct steps of
a derivation, computes only incomparable and disjoint uni ers, and is e∆ciently implemented by
uni cation.

  

Source: Antoy, Sergio - Department of Computer Science, Portland State University

 

Collections: Computer Technologies and Information Sciences