Vanhoof, W., B. Martens, D. D. Schreye, and K. D. Vlaminck: 1998, `Specialising The Other Way Around'. In: J. Ja#ar #ed.#: Proceedings of the Joint International Conference and Symposium on Logic Programming. pp. 279#293. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Analysis and Specialisation of Imperative Programs: An approach.. - Estrada (2000) (Correct)
....for the domain of linear arithmetic constraints in order to get a correct de nition of the instance relation (de nition 3.5) and more precise results of the upper bound operation (de nition 3. 8) For instance, 7 Other approaches besides unfolding exist for the same purpose e.g. BU specialisation [VMSV98]. 8 The unfolding rule may be viewed as a combination of several rules. 46 CHAPTER 3. SPECIALISATION OF CLP given the atom p(2) with no constraint (true) the associated constraint atom is hp(X) X=2i. A new fresh variable is introduced and an equality constraint is appended to the existing ....
Wim Vanhoof, Bern Martens, Danny De Schreye, and Karel De Vlaminck. Specialising the other way around. In Joxan Ja ar, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 279-293. MIT Press, 1998.
Bottom-up Specialisation of Logic Programs - Vanhoof, De Schreye, Martens (1998) (1 citation) (Correct)
....a stand alone specialisation technique, useful when a program needs to be specialised with respect to its internal structure instead of a goal (as in the library example) On the other hand, the bottom up transformation can be combined with a more traditional topdown partial deduction strategy. In [6], we describe a concrete control scheme for bottom up partial deduction, derived from top down control techniques. As an illustration, it is shown that the Vanilla meta interpreter can excellently be specialised by alternating a bottom up transformation and a classical top down specialisation ....
W. Vanhoof, B. Martens, D. De Schreye, and K. De Vlaminck. Specialising the other way around. In J. Jaffar, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, Manchester, United Kingdom, June 1998. MIT-Press.
Bottom-up Partial Deduction of Logic Programs - Vanhoof, De Schreye, Martens (1999) (1 citation) Self-citation (Vanhoof Martens De schreye) (Correct)
....While in general A C P is not continuous, it can be de ned nitary. This is mandatory if we plan to use it for program transformation, since the transformation as well as the resulting program must be nite. Also, while the de ned A C P operator is monotonic, practical control (as the one in [VMSV98] may use parent generalisation (cutting away parts of a dag built so far) and destroy overall A C P monotonicity. As noted in [BGLM94b, BGLM94a] T C P is in essence a set of resultants that can be seen as the result of a top down partial deduction of P with respect to a set of atomic ....
....the advantages of bottom up as well as top down specialisation, both techniques should be integrated into a generalised framework. Examples using such a preliminary integration (alternating the bottom up transformation as described in Section 5 with an almost trivial top down unfolding rule; see [VMSV98] show that excellent specialisation in the case of the Vanilla metainterpreter can be achieved. Equally good results can be obtained by a top down control strategy alone, but often at the cost of not completely general or automatic techniques (e.g. LS90] or a nontrivial and complex control ....
W. Vanhoof, B. Martens, D. De Schreye, and K. De Vlaminck. Specialising the other way around. In J. Ja ar, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 279-293, Manchester, United Kingdom, June 1998. MIT Press. 33
Bottom Up Specialisation: Towards General Foundations - Vanhoof, De Schreye, Martens Self-citation (Vanhoof Martens De schreye) (Correct)
....down evaluation (or SLD resolution) to evaluate the program parts that depend on the known input and generate a new program that computes its result using only the remainder of the input. Since the new program has less computations to perform, in general, it will be more efficient. In recent work [12], we argued the need for a complementary partial deduction technique, capable of specialising a program w.r.t. a set of (unit) clauses instead of a goal. It seems natural to define such a specialisation scheme in terms of bottom up evaluation. During evaluation, the information from the unit ....
.... Supported by a specialisation grant of the Flemish Institute for the Promotion of Scientific Technological Research in Industry (IWT) Belgium. Senior Research Associate of the Belgian National Fund for Scientific Research. y Partially supported by Esprit project 25503, ARGo In [12], we developed a specific, and very concrete control scheme for such a bottom up transformation and provided some examples showing that a combination of bottom up transformation and classical (goal directed) top down partial deduction achieves at least equally good results as a top down scheme ....
[Article contains additional citation context not shown here]
W. Vanhoof, B. Martens, D. De Schreye, and K. De Vlaminck. Specialising the other way around. In J. Jaffar, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, Manchester, United Kingdom, June 1998. To appear (MIT-Press).
Regular Trees as an Abstract Domain for Program Specialisation - Gallagher, Peralta (2000) (Correct)
No context found.
Vanhoof, W., B. Martens, D. D. Schreye, and K. D. Vlaminck: 1998, `Specialising The Other Way Around'. In: J. Ja#ar #ed.#: Proceedings of the Joint International Conference and Symposium on Logic Programming. pp. 279#293.
Techniques for on- and Off-Line Specialisation of Logic Programs - Vanhoof (Correct)
No context found.
BIBLIOGRAPHY 323 Vanhoof, W., B. Martens, D. D. Schreye, and K. D. Vlaminck (1998). Specialising the other way around. In J. Ja#ar (Ed.), Proceedings of the Joint International Conference and Symposium on Logic Programming, Manchester, United Kingdom, pp. 279--293. MIT-Press.
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