E. Albert and G. Vidal. The narrowing-driven approach to functional logic program specialization. New Generation Computing, 20(1):3--26, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

No context found.

E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 20(1):3-26, 2002.

No context found.

E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 20(1):3--26, 2002.

No context found.

E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 20(1):3-26, 2002.

....The new, residual program (hopefully) runs more e#ciently than the original one since those computations that depend only on the known data have been performed once and for all at partial evaluation time. Our program transformer is based on the narrowing driven approach to partial evaluation (see [5] for a survey) The syntax of multi paradigm declarative programs is closer to the one of pure functional programs. In spite of this, the narrowing driven partial evaluation framework shares more similarities with unification based methods for the partial evaluation of logic programs [26] than to ....

....: abstract(E i , E # ) i : i 1; Until E i = E i 1 (modulo renaming) Return: # : build residual program(E i , R) Fig. 4. Narrowing Driven Partial Evaluation Procedure its function calls are instances of the already computed expressions in the set (a formal definition can be found in [5], 6] This iterative style of performing partial evaluation was first described by Gallagher [16] for the partial evaluation of logic programs. The basic partial evaluation procedure can be seen in Fig. 4. The operator unfold takes a set of expressions, computes a finite set of (possibly ....

E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 20(1):3--26, 2002.

....the bene ts of using pro ling information in the eld of program transformation. Future work includes two di erent lines of research. Currently, our main concern is to investigate the combination of the symbolic pro ler with existing partial evaluation techniques for functional logic languages [6, 7] in order to guide the specialization process. We are also working on the de nition of a new semantics characterization able to cope with all the features of modern multi paradigm language implementations: sharing of common variables, nondeterminism, search strategies, concurrency, etc. A ....

E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 20(1):3-26, 2002.

....of this algorithm in order to compute program dependences; nally, we present a method to construct the desired program slice from the computed program dependences. 3. 1 Monovariant Monogenetic Partial Evaluation In this section, we recall the main algorithm of narrowing driven partial evaluation [3, 4]. Essentially, it proceeds by iteratively unfolding a set of function calls, testing the closedness of the unfolded expressions, and adding to the current set those calls (in the derived expressions) which are not closed. This process is repeated until all the unfolded expressions are closed, ....

E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 20(1):3-26, 2002.

....which produced such residual rules. This allows us to determine whether an improvement has been achieved and, moreover, to quantify this improvement. To center the discussion, we apply these ideas to a particular PE framework: the narrowing driven approach to the PE of functional logic programs [4, 6]. This framework has been recently extended to cope with modern implementations of functional logic programming in [2, 3] by translating source programs into an intermediate form called at representation [20, 22, 23, 27] where all the features of these language implementations can be represented ....

.... PE methods for logic programs (e.g. partial deduction [26] and conjunctive partial deduction [14] as well as to some (on line) PE methods for functional programs (like supercompilation [31] generalized partial computation [15] and positive supercompilation [30] the closest to our framework [4, 6]) As a starting point, we extend the standard semantics for functional logic programs in at form the LNT calculus [21] with abstract costs. Our abstract costs are based on the cost criteria introduced in [1, 11] to measure the cost of functional logic computations: the number of steps, the ....

[Article contains additional citation context not shown here]

E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 2001. To appear.

No context found.

E. Albert and G. Vidal. The narrowing-driven approach to functional logic program specialization. New Generation Computing, 20(1):3--26, 2002.

No context found.

E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 20(1):3--26, 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC