The Narrowing-Driven Approach to Functional Logic Program Specialization

The Narrowing-Driven Approach to Functional Logic Program Specialization (2002)

Cached

Download Links

[www.dsic.upv.es]
[www.dsic.upv.es]
[www.dsic.upv.es]

Other Repositories/Bibliography

DBLP

by Elvira Albert , German Vidal

Venue:	New Generation Computing
Citations:	32 - 18 self

BibTeX

@ARTICLE{Albert02thenarrowing-driven,
    author = {Elvira Albert and German Vidal},
    title = {The Narrowing-Driven Approach to Functional Logic Program Specialization},
    journal = {New Generation Computing},
    year = {2002},
    volume = {20},
    pages = {2002}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Partial evaluation is a semantics-based program optimization technique which has been investigated within di#erent programming paradigms and applied to a wide variety of languages. Recently, a partial evaluation framework for functional logic programs has been proposed.

Citations

823	T.Nipkow : Term Rewriting and All That - Baader - 1998
533	A transformation system for developing recursive programs - Burstall, Darlington - 1977
317	The integration of functions into logic programming: From theory to practice - Hanus - 1994
273	A needed narrowing strategy - Antoy, Echahed, et al.
230	Tutorial notes on partial evaluation - Consel, Danvy - 1993
230	Partial evaluation in logic programming - Lloyd, Shepherdson - 1991
162	Canonical forms and unification - Hullot - 1980
155	Logic programming with functions and predicates: The language BABEL - Moreno-Navarro, Rodriguez-Artalejo - 1992
155	The concept of a supercompiler - Turchin - 1986
141	Tutorial on specialisation of logic programs - Gallagher - 1993
138	Definitional trees - Antoy - 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
113	ILSoudergaard MIX: a self-applicable partial evaluator for experiments in compiler generation - Jones - 1989
110	T OY: A multiparadigm declarative system - López-Fraguas, Sánchez-Hernández - 1999
102	Kernel LEAF: A Logic plus Functional Language - Giovannetti, Levi, et al. - 1991
101	the tree theorem, and Vazsonyi’s conjecture - Well-quasi-ordering - 1960
100	Narrowing as the Operational Semantics of Functional Languages - Reddy - 1985
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
86	Computations in orthogonal rewriting systems - Huet, Lévy - 1991
77	Narrowing-driven partial evaluation of functional logic programs - Alpuente, Falaschi, et al. - 1996
74	Higher-Order Narrowing with Definitional Trees - Hanus, Prehofer - 1999
69	Automated theorem-proving for theories with simplifiers, commutativity - Slagle - 1974
69	N.: A Positive Supercompiler - Glück, Sørensen, et al. - 1996
66	An algorithm of generalization in positive supercompilation - Sørensen, Glück - 1995
59	A general criterion for avoiding infinite unfolding during partial deduction - Bruynooghe, Schreye, et al. - 1992
59	Ensuring global termination of partial deduction while allowing flexible polyvariance - Martens, Gallagher - 1995
57	Improving Homeomorphic Embedding for Online Termination - Leuschel
45	Partial deduction and driving are equivalent - Glück, Sørensen - 1994
44	Loop checking in partial deduction - Bol - 1993
43	Partial Evaluation of Computation Process—an Approach to a Compiler-Compiler - Futamura - 1971
36	Spezialisation of lazy functional logic programs - Alpuente, Falaschi, et al. - 1997
36	Conjunctive partial deduction: Foundations, control, algorithms and experiments - Schreye, Glück, et al. - 1999
34	A self-applicable partial evaluator for term rewriting systems - Bondorf - 1989
31	de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration - Leuschel, Schreye, et al. - 1996
21	Specialization of Inductively Sequential Functional Logic Programs - Alpuente, Hanus, et al. - 1999
21	A comparative revisitation of some program transformation techniques - Pettorossi, Proietti
20	Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages - Albert, Antoy, et al.
19	An Abstract Machine Based System for a Lazy Narrowing Calculus - Hortalá-González, Ullán
18	The universal resolving algorithm: Inverse computation in a functional language - Abramov, Glück
18	Improving control in functional logic program specialization - Albert, Alpuente, et al. - 1998
16	A Practical Partial Evaluator for a MultiParadigm Declarative Language - Albert, Hanus, et al.
14	Using an Abstract Representation to Specialize Functional Logic Programs - Albert, Hanus, et al. - 1955
12	A Constraint-Based Partial Evaluator for Functional Logic Programs and its Application - Lafave - 1998
12	Turchin’s supercompiler revisited: an operational theory of positive information propagation - Sørensen - 1996
11	A program development methodology based on a unified approach to execution and transformation - Darlington, Pull - 1988
11	A Transformation System for CLP with Dynamic Scheduling and CCP - Etalle, Gabbrielli, et al. - 1997
8	A partial evaluation framework for curry programs - Albert, Alpuente, et al. - 1999
3	Schreye, “Controlling Generalization and Polyvariance in Partial Deduction of Normal Logic Programs - Leuschel, Martens, et al. - 1998