#### DMCA

## Controlling generalisation and polyvariance in partial deduction of normal logic programs (1996)

Citations: | 55 - 37 self |

### Citations

4740 |
Introduction to Automata Theory, Languages, and Computation
- Hopcroft, Motwani, et al.
- 2000
(Show Context)
Citation Context ...acteristic paths. A characteristic path being a sequence, we can simply concatenate two characteristic paths 1 ; 2 . For this we will use the standard notation 1 2 from formal language theory =-=[1, 29]-=-. Lemma 3.23 Let P be a program, (A; A ) and (A; A ) safe P -characteristic atoms with A A . Let A 0 2sP (A; A ) and C 2 resultants( A ) n resultants( A ). IfsA 0 resolves with C t... |

2070 |
Foundations of Logic Programming
- Lloyd
- 1984
(Show Context)
Citation Context ...mer approach into one using global trees, and thus not requiring any depth bound. 2 Preliminaries and Motivations Throughout this paper, we suppose familiarity with basic notions in logic programming =-=[48]-=- and partial deduction [49]. Notational conventions are standard and self-evident. In particular, in programs, we denote variables through strings starting with (or usually just consisting of) an uppe... |

815 | Rewrite Systems
- Dershowitz, Jouannaud
- 1990
(Show Context)
Citation Context ...e 2 ; : : : in V there are i < j such that e i V e j . We also say that V is a well-quasi order (wqo) on V . An interesting wqo is the homeomorphic embedding relation . It has been adapted from =-=[16, 17]-=-, where it is used in the context of term rewriting systems, for use in supercompilation in [65]. Its usefulness as a stop criterion for partial evaluation is also discussed and advocated in [50]. Som... |

705 |
Partial Evaluation and Automatic Program Generation
- Jones, Gomard, et al.
- 1993
(Show Context)
Citation Context ...al Logic and Formal Languages]: Mathematical Logic | logic programming, D.1.6 [Programming Techniques]: Logic Programming. 1 Introduction A major concern in the specialisation of functional (see e.g. =-=[8, 31, 67]-=-) as well as logic programs (see e.g [49, 35, 19, 57, 10]) has been the issue of control: How can the transformation process be guided in such a way that termination is guaranteed and results are sati... |

494 | Termination of Rewriting
- Dershowitz
- 1987
(Show Context)
Citation Context ...e 2 ; : : : in V there are i < j such that e i V e j . We also say that V is a well-quasi order (wqo) on V . An interesting wqo is the homeomorphic embedding relation . It has been adapted from =-=[16, 17]-=-, where it is used in the context of term rewriting systems, for use in supercompilation in [65]. Its usefulness as a stop criterion for partial evaluation is also discussed and advocated in [50]. Som... |

316 | Abstract interpretation and application to logic programs
- Cousot, Cousot
- 1992
(Show Context)
Citation Context ...enite programs, via the trace terms of [23]. 47 Algorithm 4.29 can also be seen as performing an abstract interpretation on an innite domain of innite height (i.e. the ascending chain condition of =-=[9]-=- is not satised) and without a priori limitation of the precision (i.e., if possible, we do not perform any abstraction at all and obtain simply the concrete results). Very few abstract interpretatio... |

256 |
Partial Evaluation in Logic Programming
- Lloyd, Shepherdson
- 1991
(Show Context)
Citation Context ...ic | logic programming, D.1.6 [Programming Techniques]: Logic Programming. 1 Introduction A major concern in the specialisation of functional (see e.g. [8, 31, 67]) as well as logic programs (see e.g =-=[49, 35, 19, 57, 10]-=-) has been the issue of control: How can the transformation process be guided in such a way that termination is guaranteed and results are satisfactory? This problem has been tackled from two (until n... |

246 | Tutorial notes on partial evaluation
- Consel, Danvy
- 1993
(Show Context)
Citation Context ...al Logic and Formal Languages]: Mathematical Logic | logic programming, D.1.6 [Programming Techniques]: Logic Programming. 1 Introduction A major concern in the specialisation of functional (see e.g. =-=[8, 31, 67]-=-) as well as logic programs (see e.g [49, 35, 19, 57, 10]) has been the issue of control: How can the transformation process be guided in such a way that termination is guaranteed and results are sati... |

237 |
Unification revisited
- Lassez, Maher, et al.
- 1988
(Show Context)
Citation Context ...enerally not such a good idea. Indeed, two atoms can be unfolded and specialised in a very similar way in the context 3 Also known as anti-unication or least general generalisation, see for instance =-=[37]-=-. 5 of one program P 1 , while in the context of another program P 2 their specialisation behaviour can be drastically dierent. The syntactic structure of the two atoms is of course unaected by the ... |

207 | A Practical Framework for the Abstract Interpretation of Logic Programs
- Bruynooghe
- 1991
(Show Context)
Citation Context ...e do not perform any abstraction at all and obtain simply the concrete results). Very few abstract interpretations of logic programs use innite domains of innite height (some notable exceptions are =-=[5, 30, 27]-=-) and to our knowledge all of them have some a priori limitation of the precision, at least in practice. An adaptation of Algorithm 4.29, with its non ad hoc termination and precise generalisations, m... |

194 | The concept of a supercompiler
- Turchin
- 1986
(Show Context)
Citation Context ...al Logic and Formal Languages]: Mathematical Logic | logic programming, D.1.6 [Programming Techniques]: Logic Programming. 1 Introduction A major concern in the specialisation of functional (see e.g. =-=[8, 31, 67]-=-) as well as logic programs (see e.g [49, 35, 19, 57, 10]) has been the issue of control: How can the transformation process be guided in such a way that termination is guaranteed and results are sati... |

153 | Tutorial on specialisation of logic programs
- Gallagher
- 1993
(Show Context)
Citation Context ...ic | logic programming, D.1.6 [Programming Techniques]: Logic Programming. 1 Introduction A major concern in the specialisation of functional (see e.g. [8, 31, 67]) as well as logic programs (see e.g =-=[49, 35, 19, 57, 10]-=-) has been the issue of control: How can the transformation process be guided in such a way that termination is guaranteed and results are satisfactory? This problem has been tackled from two (until n... |

150 | Transformation of logic programs: foundations and techniques
- Pettorossi, Proietti
- 1994
(Show Context)
Citation Context ...ic | logic programming, D.1.6 [Programming Techniques]: Logic Programming. 1 Introduction A major concern in the specialisation of functional (see e.g. [8, 31, 67]) as well as logic programs (see e.g =-=[49, 35, 19, 57, 10]-=-) has been the issue of control: How can the transformation process be guided in such a way that termination is guaranteed and results are satisfactory? This problem has been tackled from two (until n... |

130 | Non-failure analysis for logic programs
- DEBRAY, LÓPEZ-GARCÍA, et al.
- 1997
(Show Context)
Citation Context ...y) more precise abstraction, causing a yet smaller global precision loss. Finally, one might also try to incorporate more detailed eciency and cost estimations into the global control, e.g. based on =-=[14, 15]-=-, in order to analyse the trade-o between improved specialisation and increased polyvariance and code size. 5 Experimental Results and Discussion 5.1 Systems In this section we present an implementat... |

125 |
Deriving Descriptions of Possible Value of Program Variables by means of Abstract Interpretation
- Janssens, Bruynooghe
- 1993
(Show Context)
Citation Context ...e do not perform any abstraction at all and obtain simply the concrete results). Very few abstract interpretations of logic programs use innite domains of innite height (some notable exceptions are =-=[5, 30, 27]-=-) and to our knowledge all of them have some a priori limitation of the precision, at least in practice. An adaptation of Algorithm 4.29, with its non ad hoc termination and precise generalisations, m... |

124 |
Mix: A self-applicable partial evaluator for experiments in compiler generation
- Jones, Sestoft, et al.
- 1989
(Show Context)
Citation Context ...plies considerably the core specialisation program, thus often reducing the overall complexity of the transformation process. It also renders specialisation more readily amenable to self-application =-=[32, 26]-=- and the realisation of the well-known Futamura projections. Most specialisation research in logic programming has not been concerned with anything beyond thesrst Futamura (or specialiser [24]) projec... |

111 | An Automatic Partial Evaluator for Full Prolog
- Sahlin
- 1991
(Show Context)
Citation Context ...o remedy this, the constants and functors are partitioned into the static ones, occurring in the original program and the partial deduction query, and the dynamic ones. (This approach is also used in =-=[63, 64]-=-.) The set of dynamic constants and functors is possibly innite, and we will therefore treat it like the innite set of variables in Denition 4.15 by adding the following rule to the ecce system: 42... |

96 | Automatic online partial evaluation
- Weise, Conybeare, et al.
(Show Context)
Citation Context ...mainly stressed the former, while supercompilation of functional [67, 68, 65] and partial deduction of logic programs [21, 64, 4, 6, 52, 54] have concentrated on on-line control. (Some exceptions are =-=[69, 56, 38, 33]-=-.) Basically, within the o-line approach, an analysis phase (by hand and/or automatically), prior to the specialisation proper, provides annotations that guide the specialiser when it has to decide o... |

67 |
The Derivation of an Algorithm for Program Specialisation
- Gallagher, Bruynooghe
- 1990
(Show Context)
Citation Context ... versus on-line approaches. Partial evaluation of functional programs [8, 31] has mainly stressed the former, while supercompilation of functional [67, 68, 65] and partial deduction of logic programs =-=[21, 64, 4, 6, 52, 54]-=- have concentrated on on-line control. (Some exceptions are [69, 56, 38, 33].) Basically, within the o-line approach, an analysis phase (by hand and/or automatically), prior to the specialisation pro... |

64 | Ensuring global termination of partial deduction while allowing flexible polyvariance
- Martens, Gallagher
- 1995
(Show Context)
Citation Context ... versus on-line approaches. Partial evaluation of functional programs [8, 31] has mainly stressed the former, while supercompilation of functional [67, 68, 65] and partial deduction of logic programs =-=[21, 64, 4, 6, 52, 54]-=- have concentrated on on-line control. (Some exceptions are [69, 56, 38, 33].) Basically, within the o-line approach, an analysis phase (by hand and/or automatically), prior to the specialisation pro... |

63 | A general criterion for avoiding infinite unfolding during partial deduction - Bruynooghe, Schreye, et al. - 1992 |

50 |
Loop checking in partial deduction
- Bol
- 1993
(Show Context)
Citation Context ... versus on-line approaches. Partial evaluation of functional programs [8, 31] has mainly stressed the former, while supercompilation of functional [67, 68, 65] and partial deduction of logic programs =-=[21, 64, 4, 6, 52, 54]-=- have concentrated on on-line control. (Some exceptions are [69, 56, 38, 33].) Basically, within the o-line approach, an analysis phase (by hand and/or automatically), prior to the specialisation pro... |

50 | Global control for partial deduction through characteristic atoms and global trees
- Leuschel, Martens
- 1996
(Show Context)
Citation Context ...presented in a somewhat preliminary form in two earlier workshop papers: [39] describes how to impose characteristic trees and perform set-based partial deduction with characteristic atoms, while =-=[45]-=- elaborates the former approach into one using global trees, and thus not requiring any depth bound. 2 Preliminaries and Motivations Throughout this paper, we suppose familiarity with basic notions in... |

49 | Meta-programming in logic programming
- HILL, GALLAGHER
- 1998
(Show Context)
Citation Context ...uilt so far. It heavily in uences the computation because new bindings have to be added and checked for compatibility with the current substitution. Another example is the \mixed" meta-interpreter of =-=[28, 42]-=- (sometimes called InstanceDemo; part of it is depicted in Figure 5) for the ground representation in which the goals are \lifted" to the non-ground representation 26 @@R s? (1) 2 (2)srev(L; [];R)s... |

49 |
The ecce partial deduction system and the dppd library of benchmarks, Obtainable via http://www.cs.kuleuven.ac.be/~dtai
- Leuschel
- 1996
(Show Context)
Citation Context ...riments which highlight the practical benets of the implementation over existing partial deduction systems. The system which integrates the ideas of this paper, called ecce, is publicly available in =-=[40]-=- and is actually an implementation of a generic version of Algorithm 4.29 which allows the advanced user to change and even implement e.g. the unfolding rule as well as the abstraction operator and no... |

47 |
The algorithm of generalization in the supercompiler
- Turchin
- 1988
(Show Context)
Citation Context ...l now) largely separate angles: the so-called o-line versus on-line approaches. Partial evaluation of functional programs [8, 31] has mainly stressed the former, while supercompilation of functional =-=[67, 68, 65]-=- and partial deduction of logic programs [21, 64, 4, 6, 52, 54] have concentrated on on-line control. (Some exceptions are [69, 56, 38, 33].) Basically, within the o-line approach, an analysis phase ... |

45 |
An introduction to partial deduction
- Komorowski
- 1992
(Show Context)
Citation Context |

43 | Redundant argument filtering of logic programs - Leuschel, Sørensen - 1996 |

39 |
Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs
- Proietti, Pettorossi
- 1991
(Show Context)
Citation Context ...n [46], as well as an extension of partial deduction [43, 25] to incorporate more powerful unfold/fold-like transformations [57], allowing for example to eliminate unnecessary variables from programs =-=[61]-=-. The latter extension boils down to the lifting of entire goals (instead of separate atoms) to the global level, as for instance in supercompilation (where non-atomic goals translate into nested func... |

37 | A Self-Applicable Partial Evaluator for the Logic Programming Language Gödel
- Gurr
- 1994
(Show Context)
Citation Context ...plies considerably the core specialisation program, thus often reducing the overall complexity of the transformation process. It also renders specialisation more readily amenable to self-application =-=[32, 26]-=- and the realisation of the well-known Futamura projections. Most specialisation research in logic programming has not been concerned with anything beyond thesrst Futamura (or specialiser [24]) projec... |

37 |
Logimix: A self-applicable partial evaluator for Prolog
- MOGENSEN, BONDORF
- 1992
(Show Context)
Citation Context ...mainly stressed the former, while supercompilation of functional [67, 68, 65] and partial deduction of logic programs [21, 64, 4, 6, 52, 54] have concentrated on on-line control. (Some exceptions are =-=[69, 56, 38, 33]-=-.) Basically, within the o-line approach, an analysis phase (by hand and/or automatically), prior to the specialisation proper, provides annotations that guide the specialiser when it has to decide o... |

37 | Automatic finite unfolding using well-founded measures - Martens, Schreye - 1996 |

36 | Logic program specialisation: How to be more specific
- Leuschel, Schreye
- 1996
(Show Context)
Citation Context ...ding of meta-interpreters and a good treatment of truly non-determinate programs are among the most pressing. Recent work brought a closer integration of abstract interpretation and partial deduction =-=[46]-=-, as well as an extension of partial deduction [43, 25] to incorporate more powerful unfold/fold-like transformations [57], allowing for example to eliminate unnecessary variables from programs [61]. ... |

36 |
Multiple Specialization using Minimal-Function Graph Semantics
- Winsborough
- 1992
(Show Context)
Citation Context ...; djT ]); ) (member(a; [b; c; djT ]); 0 ) #1 #1 (member(X;T ); ) #1 Figure 11: Labelled global tree of Example 4.32 after post-processing A similar use of this minimisation algorithm is made in =-=[70]-=- and [62]. The former aims at minimising polyvariance in the context of multiple specialisation by optimising compilers. The latter, in a somewhat dierent context, studies polyvariant parallelisation... |

32 | The applicability of logic program analysis and transformation to theorem proving - Waal, Gallagher - 1994 |

32 | Estimating the computational cost of logic programs
- Debray, López-Garćıa, et al.
- 1994
(Show Context)
Citation Context ...y) more precise abstraction, causing a yet smaller global precision loss. Finally, one might also try to incorporate more detailed eciency and cost estimations into the global control, e.g. based on =-=[14, 15]-=-, in order to analyse the trade-o between improved specialisation and increased polyvariance and code size. 5 Experimental Results and Discussion 5.1 Systems In this section we present an implementat... |

31 | A partial evaluation procedure for logic programs - Benkerimi, Lloyd - 1990 |

31 | Controlling conjunctive partial deduction of definite logic programs
- Glück, Jørgensen, et al.
- 1996
(Show Context)
Citation Context ...ruly non-determinate programs are among the most pressing. Recent work brought a closer integration of abstract interpretation and partial deduction [46], as well as an extension of partial deduction =-=[43, 25]-=- to incorporate more powerful unfold/fold-like transformations [57], allowing for example to eliminate unnecessary variables from programs [61]. The latter extension boils down to the lifting of entir... |

29 |
An algorithm of generalization in positive supercompilation
- Srensen, Gluck
- 1995
(Show Context)
Citation Context ...trees and characteristic atoms, can be found in Appendix D. We conclude this section with a brief discussion on the relation between our global control and what may be termed thus in supercompilation =-=[67, 68, 65]-=-. (A distinction between local and global control is not yet made in supercompilation, but we feel that this situation is likely to change in the near future.) We already pointed out that the inspirat... |

27 | Conjunctive partial deduction in practice
- Jørgensen, Leuschel, et al.
- 1996
(Show Context)
Citation Context ...range of challenging new control issues. It turned out that the global control techniques presented in the current paper can be extended and that they signicantly contribute in that context too (see =-=[43, 25, 34]-=-). Acknowledgements We would like to thank John Gallagher and Maurice Bruynooghe for interesting remarks and for pointing out several improvements. We also thank the following persons for interesting ... |

27 | Sound and complete partial deduction with unfolding based on well-founded measures, Theoretical Computer Science 122(1 - Martens, Schreye, et al. - 1994 |

25 | Implementation of Multiple Specialization in Logic Programs
- Puebla, Hermenegildo
- 1995
(Show Context)
Citation Context ... ) (member(a; [b; c; djT ]); 0 ) #1 #1 (member(X;T ); ) #1 Figure 11: Labelled global tree of Example 4.32 after post-processing A similar use of this minimisation algorithm is made in [70] and =-=[62]-=-. The former aims at minimising polyvariance in the context of multiple specialisation by optimising compilers. The latter, in a somewhat dierent context, studies polyvariant parallelisation and spec... |

24 | Ecological partial deduction: Preserving characteristic trees without constraints
- Leuschel
- 1995
(Show Context)
Citation Context ... . Section 6 subsequently concludes the paper. Finally, we would like to mention that part of the material in this paper was presented in a somewhat preliminary form in two earlier workshop papers: =-=[39]-=- describes how to impose characteristic trees and perform set-based partial deduction with characteristic atoms, while [45] elaborates the former approach into one using global trees, and thus not r... |

24 | A conceptual embedding of folding into partial deduction: Towards a maximal integration
- Leuschel, Schreye, et al.
- 1996
(Show Context)
Citation Context ...ruly non-determinate programs are among the most pressing. Recent work brought a closer integration of abstract interpretation and partial deduction [46], as well as an extension of partial deduction =-=[43, 25]-=- to incorporate more powerful unfold/fold-like transformations [57], allowing for example to eliminate unnecessary variables from programs [61]. The latter extension boils down to the lifting of entir... |

23 |
Supporting transformations for the partial evaluation of logic programs
- Benkerimi, Hill
- 1993
(Show Context)
Citation Context ... A have a common instance. This ensures that no two specialised predicate denitions match the same (run-time) call. Usually this condition is satised by performing a renaming of the atoms in A, see =-=[20, 2]-=-. Closedness (as well as the related notion of coveredness in [3]) basically requires that every atom in the body of a resultant is matched by a specialised 2 To avoid the problematic resultant A A. 4... |

23 | Practical aspects of set based analysis
- Heintze
- 1992
(Show Context)
Citation Context ...e do not perform any abstraction at all and obtain simply the concrete results). Very few abstract interpretations of logic programs use innite domains of innite height (some notable exceptions are =-=[5, 30, 27]-=-) and to our knowledge all of them have some a priori limitation of the precision, at least in practice. An adaptation of Algorithm 4.29, with its non ad hoc termination and precise generalisations, m... |

23 | On the semantics of meta-programming and the control of partial deduction in logic programming - MARTENS - 1994 |

22 | Regular approximations of computation paths in logic and functional languages
- Gallagher, Lafave
- 1996
(Show Context)
Citation Context ...s and discussions of this paper remain valid independently of whether this normalisation is applied or not. A similar eect can be obtained, in the context of denite programs, via the trace terms of =-=[23]-=-. 47 Algorithm 4.29 can also be seen as performing an abstract interpretation on an innite domain of innite height (i.e. the ascending chain condition of [9] is not satised) and without a priori li... |

20 |
A treatment of negation during partial evaluation
- Chan, Wallace
- 1989
(Show Context)
Citation Context ...n of Algorithm 3.27 using depth bounds to ensure termination. All unfolding rules of ecce were complemented by simple more specic resolution steps in the style of sp [18]. Constructive negation (see =-=[7]-=-,[26]) has not yet been incorporated, but the selection of ground negative literals is allowed. Post-processing removal of unnecessary polyvariance, using the algorithm outlined in Section 4.6, determ... |

20 | Partial deduction of the ground representation and its application to integrity checking - Leuschel, Martens - 1995 |

19 | Efficiently generating efficient generating extensions in Prolog - JøRGENSEN, M - 1996 |

18 |
Online partial deduction of large programs
- Prestwich
- 1993
(Show Context)
Citation Context ...Even though ecce is still a prototype, the transformation times are reasonable and usually close to the ones of mixtus. ecce can certainly be speeded up considerably, maybe even by using the ideas in =-=[60]-=- which help paddy to be (except for one glitch) the fastest system overall. Note that even the system ecce-x-10 based on a depth bound of 10, outperforms the existing systems for speed of the speciali... |

18 | Specialisation of a unification algorithm - Waal, Gallagher - 1991 |

17 | Towards creating specialised integrity checks 52 M. Leuschel and M. Bruynooghe through partial evaluation of meta-interpreters
- Leuschel, Schreye
- 1995
(Show Context)
Citation Context ...uilt so far. It heavily in uences the computation because new bindings have to be added and checked for compatibility with the current substitution. Another example is the \mixed" meta-interpreter of =-=[28, 42]-=- (sometimes called InstanceDemo; part of it is depicted in Figure 5) for the ground representation in which the goals are \lifted" to the non-ground representation 26 @@R s? (1) 2 (2)srev(L; [];R)s... |

16 |
Some low-level transformations for logic programs
- Gallagher, Bruynooghe
- 1990
(Show Context)
Citation Context ... function h : Expr!IN by h(t) = s(t) v(t). The well-founded measure function h has the property that h(t) 0 and h(t) > 0 for any non-variable t. The following important lemma is proven for h(:) in =-=[20]-=- (see also [54]). Lemma 3.30 If A and B are expressions such that B is strictly more general than A, then h(A) > h(B). 23 It follows that, for every expression A, there are no innite chains of strict... |

16 | The PADDY partial deduction system
- Prestwich
- 1992
(Show Context)
Citation Context ....29, with a dierent unfolding rule, while ecce-x-10 uses a (global tree oriented) version of Algorithm 3.27 with a depth bound of 10 to ensure termination. We also compare with mixtus[64, 63], paddy =-=[59]-=- and sp [18, 19], of which the following versions have been used: mixtus 0.3.3, the version of paddy delivered with eclipse 3.5.1 and a version of sp dating from September 25 th , 1995. Basically, the... |

15 | Partial evaluation of the “real thing
- Leuschel
- 1994
(Show Context)
Citation Context ...mainly stressed the former, while supercompilation of functional [67, 68, 65] and partial deduction of logic programs [21, 64, 4, 6, 52, 54] have concentrated on on-line control. (Some exceptions are =-=[69, 56, 38, 33]-=-.) Basically, within the o-line approach, an analysis phase (by hand and/or automatically), prior to the specialisation proper, provides annotations that guide the specialiser when it has to decide o... |

14 |
de Waal. Deletion of redundant unary type predicates from logic programs
- Gallagher, A
- 1992
(Show Context)
Citation Context ...tor is only copied in the end, but never in uences the computation. As illustrated by Example 4.1 above, this state of aairs will often already be changed when one adds type checking in the style of =-=[22]-=- to even the simplest logic programs. Among larger and more sophisticated programs, cases like the above become more and more frequent, even in the absence of type checking. For instance, in an explic... |

14 |
A comparative analysis of partial deductors for pure Prolog
- Lam, Kusalik
- 1990
(Show Context)
Citation Context ...ch is used by ecce-d and sp. 11 5.2 Experiments The benchmark programs are taken from [40], short descriptions can be found in Appendix A. In addition to the \Lam & Kusalik" benchmarks (originally in =-=[36]-=-) they contain a whole set of more involved and practical examples, like e.g. a model-elimination theorem prover and a meta-interpreter for an imperative language. For the experimentation, we tried to... |

13 | An almost perfect abstraction operation for partial deduction using characteristic trees
- Leuschel, Schreye
- 1995
(Show Context)
Citation Context ...n about whether the derivation associated with a characteristic path is incomplete or successful is already implicitly present and no further precision would be gained by adding it. This is proven in =-=[41]-=-. Also, once the top-level goal is known, the characteristic path is sucient to reconstruct all the intermediate goals as well as thesnal one. Now that we have characterised derivations, we can chara... |

12 |
Tutorial on program specialisation (abstract
- Schreye, Leuschel, et al.
- 1995
(Show Context)
Citation Context |

11 | Gracefully adding negation and disjunction to Prolog - Poole, Goebel - 1986 |

11 | Partial evaluation of the "real thing - Leuschel - 1994 |

8 |
Vers une Formalisation de l' ' Evaluation Partielle
- Marlet
- 1994
(Show Context)
Citation Context ... [16, 17], where it is used in the context of term rewriting systems, for use in supercompilation in [65]. Its usefulness as a stop criterion for partial evaluation is also discussed and advocated in =-=[50]-=-. Some complexity results can be found in [66] (also summarised in [50]). Recall that expressions are formulated using the alphabet A P which we implicitly assume underlying the programs and queries u... |

7 |
A general criterion for avoiding in unfolding during partial deduction
- Bruynooghe, Schreye, et al.
- 1992
(Show Context)
Citation Context |

6 |
Redundant argument of logic programs
- Leuschel, Srensen
- 1996
(Show Context)
Citation Context ...concretisation in P of a characteristic atom in A. Also, a goal G is covered by A in P i every atom A occurring in G is a concretisation of a characteristic atom in A. 5 The FARsltering algorithm of =-=[47]-=- can be used to further improve the specialised program by removing the redundant argument of m 1 . 14 The main correctness result for partial deduction with characteristic atoms is as follows: Theore... |

6 |
Automatic unfolding using well-founded measures. The
- Martens, Schreye
- 1996
(Show Context)
Citation Context |

6 |
Computational Problems in Equational Theorem Proving
- Stillman
- 1988
(Show Context)
Citation Context ...term rewriting systems, for use in supercompilation in [65]. Its usefulness as a stop criterion for partial evaluation is also discussed and advocated in [50]. Some complexity results can be found in =-=[66]-=- (also summarised in [50]). Recall that expressions are formulated using the alphabet A P which we implicitly assume underlying the programs and queries under consideration. Remember that it may conta... |

5 |
Eciently generating ecient generating extensions in Prolog
- Jrgensen, Leuschel
- 1996
(Show Context)
Citation Context |

4 | Specialisation of a uni algorithm - Waal, Gallagher - 1991 |

3 |
On the generation of specialisers
- Gluck
- 1994
(Show Context)
Citation Context ...ion [32, 26] and the realisation of the well-known Futamura projections. Most specialisation research in logic programming has not been concerned with anything beyond thesrst Futamura (or specialiser =-=[24]-=-) projection. Self-application consequently being less of an issue, most specialisers for logic programs focus on (fully automatic) on-line control. 1 It is within this well established on-line contro... |

2 |
Partiele deductie: Een substantiele vergelijkende studie
- Meulemans
- 1995
(Show Context)
Citation Context ... [39] because it guarantees the preservation of characteristic trees. A prototype partial deduction system, using Algorithm 3.27, has been implemented and experiments with it can be found in [39] and =-=[55]-=-. We will however further improve the algorithm in the next section and present extensive benchmarks in Section 5.2. Let us conclude this section with some comments related to [41], which also solves ... |

1 |
de Waal. Analysis and Transformation of Proof Procedures
- A
- 1994
(Show Context)
Citation Context ...cially since the experiments were still conducted with a prototype which was not yet tuned for transformation speed. As already mentioned earlier, the partial deduction method of [18] was extended in =-=[11]-=- by adorning characteristic trees with a depth-k abstraction of the corresponding 46 Mixtus paddy sp Benchmark RT Size TT RT Size TT RT Size TT advisor 0.31 809 0.85 0.31 809 0.10 0.40 463 0.29 contai... |