Lafave, L.: October 1998, `A Constraint-Based Partial Evaluator for Functional Logic Programs and its Application'. Ph.D. thesis, DepartmentofComputer Science.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in lining. 6.3. Dealing with Function Calls The decision to unfold or specialize a function call in ocs is very much similar to that in the context of constraint based partial evaluation. The result has already appeared in the related literature, notably the work by Lafave and Gallagher in [16, 17, 18]. As such, in this paper, we do not address issues pertaining to in nite unfolding or specialization. We make the assumption that such decision have already been made for each functions. Treatment of call unfolding is the same as conventional constraintbased partial evaluation. On the other ....

L. Lafave. A Constraint-based Partial Evaluator for Functional Logic Programs and its Application. PhD thesis, University of Bristol, 1998.

....technique for specializing programs w.r.t. parts of their input (hence also called program specialization) This technique has been studied, among others, in the context of functional programming (e.g. 9, 19] logic programming (e.g. 12, 22] and functional logic programming (e.g. [4, 20]) While the aim of traditional partial evaluation is to specialize programs w.r.t. some known data, several PE techniques are able to go beyond this goal, achieving more powerful program optimizations. This is the case of a number of PE methods for functional programs (e.g. positive ....

Laura Lafave. A Constraint-based Partial Evaluator for Functional Logic Programs and its Application. PhD thesis, Department of Computer Science, University of Bristol, 1998. 15

....cost recurrence equations. 1 Introduction Partial evaluation is a source to source program transformation technique for specializing programs w.r.t. parts of their input (hence also called program specialization) This technique has been studied, among others, in the context of functional [12, 21], logic [14, 25] and functional logic [6, 22] programming languages. A common motivation of all partial evaluation techniques is to improve the eciency of a program while preserving its meaning. Rather surprisingly, relatively little attention has been paid to the development of formal methods ....

.... can be used to place a bound on kS (see, e.g. 8] Only a constant speedup is usually achieved, i.e. the complexity of the original and partially evaluated programs di ers by a constant factor (or, equivalently, the worst case complexity big O notation is the same) see, for instance, [7, 8, 21] for traditional partial evaluation and [34] for positive supercompilation. This is also true in partial deduction if the same execution model is also used for performing computations during partial evaluation. Of course, if one uses a di erent computational mechanism at partial evaluation time, ....

Laura Lafave. A Constraint-based Partial Evaluator for Functional Logic Programs and its Application. PhD thesis, University of Bristol, 1999.

....Partial evaluation is a source to source program transformation technique for specializing programs w.r.t. parts of their input (hence also called program specialization) This technique has been studied, among others, in the context of functional [12, 21] logic [14, 25] and functional logic [6, 22] programming languages. A common motivation of all partial evaluation techniques is to improve the efficiency of a program while preserving its meaning. Rather surprisingly, relatively little attention has been paid to the development of formal methods for reasoning about the effectiveness of this ....

Laura Lafave. A Constraint-based Partial Evaluator for Functional Logic Programs and its Application. PhD thesis, University of Bristol, 1999.

....can be integrated within a concrete partial evaluation algorithm. The abstract domain (regular approximations in this case) are used to prune resultants and to preserve information during generalisation steps. Arithmetic constraints were already used in a similar role in other systems [12], 22] In general an abstract domain is not defined over the same signature as the concrete program; for instance, the domain might be modes or types. In such cases, a concrete substitution arising during unfolding a concrete atom would have to be abstracted before checking its consistency with ....

L. Lafave. A Constraint-Based Partial Evaluator for Functional Logic Programs and its Application. PhD thesis, Department of Computer Science, October 1998.

No context found.

Lafave, L.: October 1998, `A Constraint-Based Partial Evaluator for Functional Logic Programs and its Application'. Ph.D. thesis, DepartmentofComputer Science.

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