Analyzing logic programs with dynamic scheduling

Marriott, Kim; Banda, Maria García de la; Hermenegildo, Manuel V.

doi:10.1145/174675.177883

Cited by 27 publications

(19 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, while there have also been some studies of the overhead introduced by delay declarations and their optimization (see, e.g., [21]), it is interesting to see how this overhead affects our implementation of lazy evaluation by observing its performance. Consider the nat/2 function in Figure 2, a simple function which returns a list with the first N numbers from an (infinite) list of natural numbers.…”

Section: Some Performance Measurementsmentioning

confidence: 99%

A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems

Casas

Cabeza²,

Hermenegildo

2006

Functional and Logic Programming

View full text Add to dashboard Cite

Abstract. Nondeterminism and partially instantiated data structures give logic programming expressive power beyond that of functional programming. However, functional programming often provides convenient syntactic features, such as having a designated implicit output argument, which allow function call nesting and sometimes results in more compact code. Functional programming also sometimes allows a more direct encoding of lazy evaluation, with its ability to deal with infinite data structures. We present a syntactic functional extension, used in the Ciao system, which can be implemented in ISO-standard Prolog systems and covers function application, predefined evaluable functors, functional definitions, quoting, and lazy evaluation. The extension is also composable with higher-order features and can be combined with other extensions to ISO-Prolog such as constraints. We also highlight the features of the Ciao system which help implementation and present some data on the overhead of using lazy evaluation with respect to eager evaluation.

show abstract

Section: Some Performance Measurementsmentioning

confidence: 99%

A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems

Casas

Cabeza²,

Hermenegildo

2006

Functional and Logic Programming

View full text Add to dashboard Cite

show abstract

“…None of these analyses, however, can infer initial queries that guarantee non-suspension -all check for non-suspension. Other works have proposed generic abstract interpretation frameworks for dynamic scheduling [9,18] but none of these are for goal-independent analysis.…”

Section: Related Workmentioning

confidence: 99%

Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling

Genaim

King

2003

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…These methods have been recently applied also to CLP with dynamic scheduling [10,26,9] with promising results.…”

Section: Delay Declarations Advocated By Van Emden and De Lucena [34mentioning

confidence: 99%

A transformation system for CLP with dynamic scheduling and CCP

1997

View full text Add to dashboard Cite

bstract MaurizioGabbrielli~Elena MarchioriĨ n this paper we study unfold/fold transformations for constraint logic programs (CLP) with dynamic scheduling and for concurrent constraint programming (CCP). We define suitable applicability conditions for these transformations which guarantee that the original and the transformed program have the same results of successful derivations and the same deadlock free queries.The possible applications of these results are twofold. On one hand we can use the unfold/fold system to optimize CLP and CCP programs while preserving their intended meaning and in particular without the risk of introducing deadlocks. On the other hand, unfold/fold transformations can be used for proving deadlock freeness of a class of queries in a given program: to this aim it is sufficient to apply our transformations and to specialize the resulting program with respect to the given queries in such a way that the obtained program is trivially deadlock free. As shown by several interesting examples, this yields a methodology for proving deadlock freeness which is simple and powerful at the same time. Permission to mske digital/hsrd copy of psrt or all this work for personal or clsssroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication and its date appear, and notice ia given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. PEPM '97 Amsterdam, ND @ 1997 ACM 0-89791 -917-319710006.,,$3,50 In nearly all the practical CLP systems [19] the flexibility of CLP comrrutation is further enhanced bv zdlowine " a dynamic selection rule which allows the computation to dynamically delay (or suspend) the selection of an atom until its argumente are sufficiently instantiated.This dynamic scheduling is obtained by adding the so-called delay declarations next to program clauses. Delay declarations, advocated by van Emden and de Lucena [34] and introduced explicitly in logic programmingby Naiah in [27], allow one to improve the efficiency of programs, to prevent run-time errors and to enforce termination. In many CLP systems they are used also to postpone the evaluation of constraints which are "too hard" for the solver. For example, in CLP(!R) [18] non-linear arithmetic constraints are delayed until they become linear.More generally, delay declarations provide the programmer with a better control over the computation and, similarly to guards in concurrent logic languages, allow one to express some degree of synchronization, usually called coroutining, among the different processes (i.e. stoma) in a program. In this sense, even though the underlying computational model uses a different kind of non-determinism, CLP with dynamic scheduling can be considered as an intermediate language between the purely sequential CLP and the concurrent language CCP. The increased expreasiveness of t...

show abstract

Analyzing logic programs with dynamic scheduling

Cited by 27 publications

References 18 publications

A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems

A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems

Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling

A transformation system for CLP with dynamic scheduling and CCP

Contact Info

Product

Resources

About