An Implementation of Narrowing Strategies

DMCA

An Implementation of Narrowing Strategies (2001)

Cached

Download Links

by Sergio Antoy , Bart Massey, et al.

Citations:

302 - 116 self

BibTeX

@MISC{Antoy01animplementation,
    author = {Sergio Antoy and Bart Massey and et al.},
    title = { An Implementation of Narrowing Strategies},
    year = {2001}
}

OpenURL

Abstract

This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in particular on some optimal narrowing strategies, to execute functional logic programs. We translate functional logic programs into imperative (Java) programs without an intermediate abstract machine. A central idea of our approach is the explicit representation and processing of narrowing computations as data objects. This enables the implementation of operationally complete strategies (i.e., without backtracking) or techniques for search control (e.g., encapsulated search). Thanks to the use of an intermediate and portable representation of programs, our implementation is general enough to be used as a common back end for a wide variety of functional logic languages.

Keyphrases

narrowing strategy functional logic program essential component modern functional logic language optimal narrowing strategy intermediate abstract machine search control wide variety central idea portable representation explicit representation functional logic language complete strategy data object

DMCA