A demand driven computation strategy for lazy narrowing

Loogen, Rita; López-Fraguas, Francisco Javier; Rodríguez-Artalejo, Mario

doi:10.1007/3-540-57186-8_79

Cited by 71 publications

(56 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…With respect to lazy unification, and starting with the fact (23), the rules (18), (12) and (17) simulate the evaluation of g for unifying with the first argument of f. The magic rules (13), (14) and (15) make the information passing up to the conditions of f 1 . The rule (22) allows to evaluate lazily g for unifying with the first argument of h. Therefore g is evaluated three times in order to apply the rule of f. In general, the magic rules allow to pass the (partial) evaluation of the inner function to evaluate the outermost one for the given (partial) result.…”

Section: On the Power Of Magicmentioning

confidence: 99%

“…The laziness of the evaluation will be driven by the goal evaluating program rules (arguments and conditions) as far as the goal requires. In this sense, our bottom-up evaluation is similar to the demand-driven [14] top-down evaluation of functional logic programs. As far as we know, this is the first time that such kind of evaluation method for functional logic languages has been presented.…”

Section: Introductionmentioning

confidence: 98%

“…logic variables, function inversion, nondeterminism, built-in search). The basic ideas in functional-logic programming consist in lazy narrowing as operational mechanism, following some class of narrowing strategy [2,14] combined with some kind of constraints solving [15] and higher order features [10].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs

Almendros-Jiménez

Becerra-Terón

2001

Functional and Logic Programming

View full text Add to dashboard Cite

Abstract. In this paper we start the design of a functional-logic deductive database language. Given that most logic deductive languages consider bottom-up evaluation as operational mechanism, here we will focus on the development of an operational semantics based on bottomup evaluation for functional logic languages. As in the logic paradigm, the bottom-up evaluation will consist in a magic transformation for a given program-query into a magic program-query for which the bottomup evaluation will simulate the top-down one of the original program.

show abstract

Section: On the Power Of Magicmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs

Almendros-Jiménez

Becerra-Terón

2001

Functional and Logic Programming

View full text Add to dashboard Cite

show abstract

“…The case (d) is handled by introducing rules for representing the failure of parameter passing of the nested functions. For instance the rules (9) and (10) are introduced by the rule (2) in order to obtain f(mg g N (0)) {s(F)} and f(mg g N (s(s(Z)))) {s(F)}, by using also (11) and (1) and, finally (14) and (15).…”

Section: Model Of P (In Symbols H |= P) Iff H Satisfies All the Rulementioning

confidence: 99%

“…In the cited paper, the semantics adopted for the programs is the Constructor Based ReWriting Logic (CRWL) presented in [7]. This bottom-up evaluation is based on the use of a fix point operator over CRWL-Herbrand algebras and it simulates the demand driven strategy [11] for top-down evaluation of CRWL-programs.…”

Section: Introductionmentioning

confidence: 99%

A Computational Model for Functional Logic Deductive Databases

2001

View full text Add to dashboard Cite

Abstract. This paper adds the handling of negative information to a functional-logic deductive database language. By adopting as semantics for negation the so-called CRWLF, wherein the negation is intended as 'finite failure' of reduction, we will define Herbrand algebras and models for this semantics and a fix point operator to be used in a new goaldirected bottom-up evaluation mechanism based on magic transformations. This bottom-up evaluation will simulate the top-down one of the original program; in fact, it will carry out a goal-directed lazy evaluation.

show abstract

A Deterministic Lazy Narrowing Calculus

Middeldorp

Okui

1998

Journal of Symbolic Computation

View full text Add to dashboard Cite

In this paper we study the non-determinism between the inference rules of the lazy narrowing calculus lnc (Middeldorp et al., 1996, Theoret. Comput. Sci., 167, 95-130). We show that all non-determinism can be removed without losing the important completeness property by restricting the underlying term rewriting systems to left-linear confluent constructor systems and interpreting equality as strict equality. For the subclass of orthogonal constructor systems the resulting narrowing calculus is shown to have the nice property that solutions computed by different derivations starting from the same goal are incomparable. † A preliminary version of this paper appeared in the

show abstract

A demand driven computation strategy for lazy narrowing

Cited by 71 publications

References 14 publications

A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs

A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs

A Computational Model for Functional Logic Deductive Databases

A Deterministic Lazy Narrowing Calculus

Contact Info

Product

Resources

About