An Implementation of Narrowing Strategies

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 interabstract 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. Categories and Subject Descriptors D.3.2 [Programming Languages]: Language Classifications—Multiparadigm Languages General Terms Languages, Design, Th...

• Type: Conference
• Year: 2001
• Where: PPDP
• Authors: Sergio Antoy, Michael Hanus, Bart Massey, Frank Steiner
• Keywords: Functional Logic, Functional Logic Languages, Functional Logic Programs, PPDP 2001, Programming Languages