An Abstract Machine Based System for a Lazy Narrowing Calculus

Hortalá-González, Maria Teresa; Ullán, Eva

doi:10.1007/3-540-44716-4_14

Cited by 8 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Functional logic languages have recently evolved to so called declarative multiparadigm languages like, e.g., Curry (Hanus 2003), Toy (Hortalá-González andUllán 2001) and Escher (Lloyd 1994). In order to make things concrete, we consider in this work the language Curry, a modern multi-paradigm language which integrates features from logic programming (partial data structures, built-in search), functional programming (higher-order functions, demand-driven evaluation) and concurrent…”

Section: Declarative Multi-paradigm Languagesmentioning

confidence: 99%

Forward slicing of functional logic programs by partial evaluation

Silva

Vidal

2007

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Program slicing has been mainly studied in the context of imperative languages, where it has been applied to a wide variety of software engineering tasks, like program understanding, maintenance, debugging, testing, code reuse, etc. This work introduces the first forward slicing technique for declarative multi-paradigm programs which integrate features from functional and logic programming. Basically, given a program and a slicing criterion (a function call in our setting), the computed forward slice contains those parts of the original program which are reachable from the slicing criterion. Our approach to program slicing is based on an extension of (online) partial evaluation. Therefore, it provides a simple way to develop program slicing tools from existing partial evaluators and helps to clarify the relation between both methodologies. A slicing tool for the multi-paradigm language Curry, which demonstrates the usefulness of our approach, has been implemented in Curry itself.

show abstract

Section: Declarative Multi-paradigm Languagesmentioning

confidence: 99%

Forward slicing of functional logic programs by partial evaluation

Silva

Vidal

2007

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…et al, 2003), the Münster Curry Compiler (Lux, 2003), and some implementations of Toy (Hortalá-González and Ullán, 2001), programs are translated into a flat representation (in the former two cases, it is called FlatCurry). This intermediate representation-originally introduced by Hanus and Prehofer (1999)-is based on the idea to "compile" definitional trees into specific rewrite rules.…”

Section: The Flat Languagementioning

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

“…Similar representations are considered in [13,14,17]. Unlike them, here we distinguish two kinds of case expressions in order to make also explicit the flexible/rigid evaluation annotations of source programs.…”

Section: The Flat Languagementioning

confidence: 99%

A Memoizing Semantics for Functional Logic Languages

España

Estruch

2004

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Declarative multi-paradigm languages combine the main features of functional and logic programming, like laziness, logic variables and non-determinism. The operational semantics of these languages is based on a combination of narrowing and residuation. In this article, we introduce a non-standard memoizing semantics for multi-paradigm declarative programs and prove its equivalence with the standard operational semantics. Both pure functional and pure logic programming have for long time taken advantage of tabling or memoizing schemes [15,19,7], which motivates the interest in the adapation of this technique to the integrated paradigm.

show abstract

An Abstract Machine Based System for a Lazy Narrowing Calculus

Cited by 8 publications

References 13 publications

Forward slicing of functional logic programs by partial evaluation

Forward slicing of functional logic programs by partial evaluation

Cost-Augmented Partial Evaluation of Functional Logic Programs

A Memoizing Semantics for Functional Logic Languages

Contact Info

Product

Resources

About