Termination of narrowing via termination of rewriting



Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in different contexts, ranging from theorem proving (e.g., protocol verification) to language design (e.g., it forms the basis of functional logic languages). Surprisingly, the termination of narrowing has been mostly overlooked. In this work, we present a novel approach for analyzing the termination of narrowing in left-linear constructor systems—a widely accepted class of systems—that allows us to reuse existing methods in the literature on termination of rewriting.


Narrowing Term rewriting Termination 

Mathematics Subject Classification (2000)

68N17 68Q42 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.Graduate School of Information ScienceNagoya UniversityNagoyaJapan
  2. 2.MiST, DSIC, Universidad Politécnica de ValenciaValenciaSpain

Personalised recommendations