M. Leuschel, B. Martens, and D. de Schreye. Some achievements and prospects in partial deduction. ACM Computing Surveys, 30 (Electronic Section)(3es):4, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....which is known at compile time) allows us to derive a new, more ecient program in which the portion of the output which depends on the static input, has already been computed. Partial evaluation has been applied in several areas of computer science, and it has been applied also to logic programs [13, 25, 28], where it is also called partial deduction. In this paper we follow a rule based approach to the specialization of logic A preliminary version of this paper appears as: Reducing Nondeterminism while Specializing Logic Programs. Proceedings of the 24th Annual ACM Symposium on Principles of ....

M. Leuschel, B. Martens, and D. de Schreye. Some achievements and prospects in partial deduction. ACM Computing Surveys, 30 (Electronic Section)(3es):4, 1998.

....which is known at compile time) allows us to derive a new, more ecient program in which the portion of the output which depends on the static input, has already been computed. Partial evaluation has been applied in several areas of computer science, and it has been applied also to logic programs [10, 20, 23], where it is also called partial deduction. In this paper we follow a rule based approach to program specialization. A preliminary version of this paper appears as: Reducing Nondeterminism while Specializing Logic Programs. Proceedings of the 24th Annual ACM Symposium on Principles of ....

M. Leuschel, B. Martens, and D. de Schreye. Some achievements and prospects in partial deduction. ACM Computing Surveys, 30 (Electronic Section)(3es):4, 1998.

.... to nd a computationally e cient program T for a new n ary predicate g such that, for all ground terms t 1 ; t n , M(P ) j= GfX 1 =t 1 ; Xn =t n g i M(T ) j= g(t 1 ; t n ) Transf ) Notice that our formulation of program transformation includes program specialization [27,33,44,47] which can be regarded as the particular case where G is an atom with instantiated arguments. Program Synthesis. Given a program P and a speci cation of the form g(X 1 ; Xn ) where: i) is a rst order formula with free variables X 1 ; Xn , and (ii) g is a new n ary ....

....performing program derivation in di erent computation domains. The work on unfold fold program transformation is tightly related to other transformation techniques. In particular, partial evaluation (also called partial deduction) and other program specialization techniques la Lloyd Shepherdson [16,27,44,47] can be rephrased in terms of a subset of the unfold fold rules [56,67] Compiling control [7] is another transformation technique which is related to the rules and strategies approach. Compiling control is based on the idea expressed by Kowalski s motto: Algorithm = Logic Control, and it works ....

M. Leuschel, B. Martens, and D. de Schreye. Some achievements and prospects in partial deduction. ACM Computing Surveys, 30 (Electronic Section)(3es):4, 1998.

....invariants to describe relationships for heterogeneous data sources. Our algorithms for merging multiple code call conditions take such invariants and cost information into account when performing the merge. Another area of research that is related to ours is partial evaluation in logic programs [Leuschel et al. 1998; Lloyd and Shepherdson 1991; De Schreye et al. 1999] Partial evaluation takes a program and a goal and rewrites the program by using a set of transformations to optimize its performance. The rewritten program usually runs faster for the particular goal when SLD or SLD NF resolution is used for ....

Leuschel, M., Martens, D., and De Schreye, D. 1998. Some achievements and prospects in partial deduction. ACM Computing Surveys 30, 3es (September).

....is, a subset of the input data which are known at compile time) derives a new, more e cient program by pre computing the parts of the output which depend on the static input. Partial evaluation has been applied in several areas of computer science, and it has been applied also to logic programs [74, 101, 104], where it is also called partial deduction. In our approach, partial evaluation can be viewed as a transformation strategy for constructing a transformation sequence, say P 0 ; P n , where P 0 is the program to be specialized, P n is the specialized program, and every program of this ....

M. Leuschel, B. Martens, and D. de Schreye. Some achievements and prospects in partial deduction. ACM Computing Surveys, 30 (Electronic Section)(3es):4es, 1998.

....transformation or analysis is often ensured in an online manner. This paper is primarily aimed at studying and improving online termination techniques. The issue of online termination has possibly received the most attention within partial evaluation in general, and partial deduction [51, 17, 41, 48] an automatic technique for specialising logic programs in particular. Below, we therefore examine the case of partial deduction in more detail. Henceforth we suppose some familiarity with basic notions in logic programming [4, 50] Partial deduction based upon the Lloyd and Shepherdson ....

....corresponding to the fact that each generated SLDNF tree should be finite. The other is called the global termination problem, meaning that the set A should contain only a finite number of atoms. A similar classification can be done for most other program specialisation techniques (cf. e.g. [47, 48]) Below we mainly use local termination to illustrate our concepts. As shown in [57] the atoms in A can be structured into a global tree and methods similar to the one for local termination can then be used to ensure global termination. See also [71] for a very general, language independent, ....

M. Leuschel, B. Martens, and D. De Schreye. Some achievements and prospects in partial deduction. ACM Computing Surveys, 30(Symposium on Partial Evaluation) , September 1998. to appear.

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