Logic programming with functions and predicates: The language Babel

Moreno-Navarro, Juan José; Rodríguez-Artalejo, Mario

doi:10.1016/0743-1066(92)90024-w

Cited by 123 publications

(104 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Many useful narrowing strategies fulfill this condition, e.g., basic narrowing [41] and innermost basic narrowing [39] over arbitrary TRSs, lazy narrowing [20,54,59] and needed narrowing [8] over left-linear constructor TRSs, etc. Actually, any narrowing strategy over left-linear constructor systems fulfills the following wellknown property (see, e.g., [55,Theorem 4.1], where it is stated without proof):…”

Section: A Simple Characterization Of Narrowing Terminationmentioning

confidence: 99%

“…[37,59]. Examples of such languages based on narrowing are, e.g., LPG [15], SLOG [31], ALF [36], Babel [55], and the most recent Curry [27] and Toy [50]. Currently, narrowing is regaining popularity in a number of other areas, like protocol verification [19,29,43,52], model checking [30], partial evaluation [1,58], refining methods for proving the termination of rewriting [11,12], type checking in the language Ω mega [61], etc.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Termination of narrowing via termination of rewriting

Nishida

Vidal

2010

AAECC

View full text Add to dashboard Cite

Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in different contexts, ranging from theorem proving (e.g., protocol verification) to language design (e.g., it forms the basis of functional logic languages). Surprisingly, the termination of narrowing has been mostly overlooked. In this work, we present a novel approach for analyzing the termination of narrowing in left-linear constructor systems-a widely accepted class of systems-that allows us to reuse existing methods in the literature on termination of rewriting.

show abstract

Section: A Simple Characterization Of Narrowing Terminationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Termination of narrowing via termination of rewriting

Nishida

Vidal

2010

AAECC

View full text Add to dashboard Cite

show abstract

“…In order to avoid unnecessary computations and to deal with infinite data structures, demand-driven generation of the search space has been advocated by a number lazy narrowing strategies (Giovannetti et al, 1991;Loogen et al, 1993;Moreno-Navarro and Rodríguez-Artalejo, 1992). Due to its optimality properties w.r.t.…”

Section: Narrowingmentioning

confidence: 99%

Cost-Augmented Partial Evaluation of Functional Logic Programs

Vidal

2004

Higher-Order and Symbolic Computation

View full text Add to dashboard Cite

Abstract. We enhance the narrowing-driven partial evaluation scheme for lazy functional logic programs with the computation of symbolic costs. The enhanced scheme allows us to estimate the effects of the program transformer in a precise framework and, moreover, to quantify these effects. The considered costs are "symbolic" in the sense that they measure the number of basic operations performed during a computation rather than actual execution times. Our scheme may serve as a basis to develop speedup analyses and cost-guided transformers. A cost-augmented partial evaluator, which demonstrates the usefulness of our approach, has been implemented in the multi-paradigm language Curry.

show abstract

“…We assume the reader has familiarity with basic concepts of model theory on logic programming and functional-logic programming (see [3,17,7] for more details). We now point up some of the notions used in this paper.…”

Section: Basic Notionsmentioning

confidence: 99%

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

Logic programming with functions and predicates: The language Babel

Cited by 123 publications

References 16 publications

Termination of narrowing via termination of rewriting

Termination of narrowing via termination of rewriting

Cost-Augmented Partial Evaluation of Functional Logic Programs

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

Contact Info

Product

Resources

About