An implementation of narrowing strategies

Authors:
Sergio Antoy;Bart Massey;Michael Hanus;Frank Steiner
Affiliations:
Portland State University, Portland, OR;Portland State University, Portland, OR;Christian-Albrechts-Universität Kiel, Kiel, Germany;Christian-Albrechts-Universität Kiel, Kiel, Germany
Venue:
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Year:
2001

Citing 18
Cited 10

Implementation of narrowing: the Prolog-based approach

Logic programming languages
A needed narrowing strategy

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Encapsulated search for higher-order concurrent constraint programming

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A unified computation model for functional and logic programming

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Call by need computations to root-stable form

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that

Term rewriting and all that
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

Journal of the ACM (JACM)
Implementing Encapsulated Search for a Lazy Functional Logic Language

FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
Towards a Clean Amalgamation of Logic Programs with External Procedures

PLILP '88 Proceedings of the 1st International Workshop on Programming Language Implementation and Logic Programming
A Demand Driven Computation Strategy for Lazy Narrowing

PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Controlling Search in Declarative Programs

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Compiling Multi-Paradigm Declarative Programs into Prolog

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Definitional Trees

Proceedings of the Third International Conference on Algebraic and Logic Programming
Optimal Non-deterministic Functional Logic Computations

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Efficient Translation of Lazy Functional Logic Programs into Prolog

LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
Constructor-based conditional narrowing

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Higher-order narrowing with definitional trees

Journal of Functional Programming
Towards the uniform implementation of declarative languages

Computer Languages

Functional Logic Design Patterns

FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Constructor-based conditional narrowing

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Conditional narrowing without conditions

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Implementing functional logic languages using multiple threads and stores

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Specialization of functional logic programs based on needed narrowing

Theory and Practice of Logic Programming
A generic analysis environment for declarative programs

Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming
Reporting Failures in Functional Logic Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Programming with narrowing: A tutorial

Journal of Symbolic Computation
Multi-paradigm declarative languages

ICLP'07 Proceedings of the 23rd international conference on Logic programming
A virtual machine for functional logic computations

IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages

Quantified Score

Hi-index	0.00

Visualization

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 represen tation of programs, our implementation is general enough to be used as a common back end for a wide variety of functional logic languages.