An Implementation of Narrowing Strategies

An Implementation of Narrowing Strategies (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Sergio Antoy , Michael Hanus , Bart Massey , Frank Steiner

Venue:	Journal of the ACM
Citations:	273 - 111 self

BibTeX

@INPROCEEDINGS{Antoy01animplementation,
    author = {Sergio Antoy and Michael Hanus and Bart Massey and Frank Steiner},
    title = {An Implementation of Narrowing Strategies},
    booktitle = {Journal of the ACM},
    year = {2001},
    pages = {268--279},
    publisher = {ACM Press}
}

Years of Citing Articles

Bookmark

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.

Citations

823	T.Nipkow : Term Rewriting and All That - Baader - 1998
723	Rewrite systems - Dershowitz, Jouannaud - 1990
550	Term rewriting systems - Klop - 1992
317	The integration of functions into logic programming: From theory to practice - Hanus - 1994
155	Logic programming with functions and predicates: The language BABEL - Moreno-Navarro, Rodriguez-Artalejo - 1992
134	A unified computation model for functional and logic programming - Hanus - 1997
126	Eekelen, M.: Functional Programming and Parallel Graph Rewriting - Plasmeijer, van - 1993
110	T OY: A multiparadigm declarative system - López-Fraguas, Sánchez-Hernández - 1999
105	Building-in equational theories - Plotkin - 1972
102	Kernel LEAF: A Logic plus Functional Language - Giovannetti, Levi, et al. - 1991
100	Narrowing as the Operational Semantics of Functional Languages - Reddy - 1985
99	EQLOG: Equality, types, and generic modules for logic programming - Goguen, Meseguer - 1986
95	A demand driven computation strategy for lazy narrowing - Loogen, López-Fraguas, et al. - 1993
90	SLOG: a logic programming language interpreter based on clausal superposition and rewriting - Fribourg - 1985
89	Term graph rewriting - Barendregt, Eekelen, et al. - 1987
86	Computations in orthogonal rewriting systems - Huet, Lévy - 1991
84	Higher-order extensions to Prolog \| are they needed - Warren - 1981
84	Computing in Systems Described by Equations - O'Donnell
83	How to replace failure by a list of successes - Wadler - 1985
76	Proofs by induction in equational theories with constructors - Huet, Hullot - 1982
74	Equational Logic as a Programming Language - O'Donnell - 1985
69	Automated theorem-proving for theories with simplifiers, commutativity - Slagle - 1974
63	Programming in an integrated functional and logic language - Lloyd - 1999
59	Computations in Orthogonal Term Rewriting Systems - Huet, Lévy - 1992
56	Compiling Logic Programs with Equality - Hanus - 1990
56	Foundations of Equational Logic Programming - Hölldobler - 1989
53	Optimal non-deterministic functional logic computations - Antoy - 1298
50	Computational semantics of term rewriting systems - Boudol - 1985
49	Compiling Multi-Paradigm Declarative Programs into Prolog - Antoy, Hanus - 1794
46	A Multiparadigm Programming Language - Janson - 1994
46	Parallel Evaluation Strategies for Functional Logic Languages - Antoy, Echahed, et al. - 1997
44	Constructor-based Conditional Narrowing - Antoy - 2001
44	Call by need computations to root-stable form - Middeldorp - 1997
43	Encapsulated search in higher-order concurrent constraint programming - Schulte, Smolka - 1994
43	Design and implementation of a generic, logic and functional programming language - Bert, Echahed - 1986
41	Programming in equational logic: Beyond strong sequentiality - Sekar, Ramakrishnan - 1993
40	Sequentiality in Orthogonal Term Rewriting Systems, in: Journal of Symbolic Computation - Klop, Middeldorp - 1991
40	Lazy narrowing: Strong completeness and eager variable elimination - Middeldorp, Okui, et al. - 1996
36	Lazy narrowing in a graph machine - Moreno-Navarro, Kuchen, et al. - 1990
35	Minimal and optimal computations of recursive programs - Berry, Lévy - 1979
32	Basic Narrowing Revisited - Nutt, R'ety, et al. - 1989
31	Efficient Translation of Lazy Functional Logic Programs into Prolog - Hanus - 1995
31	Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems - Maranget
28	Improving control of logic programs by using functional logic languages - Hanus - 1992
27	Towards a Clean Amalgamation of Logic Programs with External Procedures - Bonnier, Maluszynski - 1988
26	Strongly sequential and inductively sequential term rewriting systems - Hanus, Lucas, et al. - 1998
25	Controlling Search in Declarative Programs - Hanus, Steiner - 1490
24	Admissible graph rewriting and narrowing - Duval, Echahed, et al. - 1998
23	Computing in Horn Clause Theories, volume 16 - Padawitz - 1988
22	A deterministic lazy narrowing calculus - Middeldorp, Okui - 1995