An implementation of narrowing

Alan Josephson, Nachum Dershowitz

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

In this paper we discuss implementation issues of rite, a system that performs lazy narrowing and eager rewriting with respect to a set of directed equations. We describe a novel technique for representing the multiple solutions that arise from the enumerative nondeterminism of narrowing steps. A technique for efficiently identifying redexes, based on the preprocessing of equations for partial matches/unifiers, is presented. Rewriting and narrowing are effected through demons which annotate subterms with continuations obtained from preprocessing. We show how these methods can be extended to deal with conditional equations viewed as logic programs. An experimental implementation is discussed.

Original languageEnglish
Pages (from-to)57-77
Number of pages21
JournalThe Journal of Logic Programming
Volume6
Issue number1-2
DOIs
StatePublished - 1989

Funding

FundersFunder number
National Science85-13417

    Fingerprint

    Dive into the research topics of 'An implementation of narrowing'. Together they form a unique fingerprint.

    Cite this