J. Zhang. An automatic dlist transformation algorithm for Prolog programs. Technical report, Department of Computer Science, University College of Swansea, U.K., 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Automatic Derivation of Logic Programs by Transformation - Pettorossi, Proietti (2000) (Correct)
....write and understand than the equivalent ones which make use of di erence lists. Thus, one may be interested in providing techniques for transforming in an automatic way programs which use lists, into programs which use di erencelists. Several such techniques have been proposed in the literature [82, 156]. We will show that by applying our synthesis method we can automatically perform the transformation which introduces di erence lists. Our method is very general and it can also be used to perform other changes of data representations. In general the problem of transforming programs which use ....
.... that the di erence list transformation example we have presented cannot be derived in a natural way by using the unfold fold transformations of [144] Some modi ed versions of the rules should be used instead, like, for instance, the inverse de nition and the data structure mapping introduced by [156]. Our example on the avoidance of nondeterminism shows that the unfold fold transformation technique enhanced with our synthesis method, is able to derive programs for which other methods require the o line proof of some insightful lemmas (like the schema based equivalence in [23] By using our ....
J. Zhang. An automatic dlist transformation algorithm for Prolog programs. Technical report, Department of Computer Science, University College of Swansea, U.K., 1987.
Synthesis And Transformation Of Logic Programs Using.. - Pettorossi, Proietti (1999) (4 citations) (Correct)
....write and understand than the equivalent ones which make use of di erence lists. Thus, one may be interested in providing techniques for transforming in an automatic way programs which use lists, into programs which use di erence lists. Several such techniques have been proposed in the literature [15, 31]. We will show that by applying our program synthesis method we can automatically perform the transformation which introduces di erence lists. Our method is very general and it can be used also to perform other changes of data representations. The problem of transforming programs which use ....
.... way by using the unfold fold transformations of [28] Some modi ed versions of the rules should be used instead, like, for instance, the unfold fold rules with constraints introduced by [3] for specializing logic programs, or the inverse de nition and the data structure mapping introduced by [31]. Our last example on the avoidance of nondeterminism shows that the unfold fold transformation technique enhanced with our synthesis method, is able to derive programs for which other methods require the o line proof of some insightful lemmas (like the schema based equivalence in [5] By using ....
J. Zhang. An automatic d{list transformation algorithm for Prolog programs. Technical report, Department of Computer Science, University College of Swansea, U.K., 1987.
Synthesis And Transformation Of Logic Programs Using.. - Pettorossi, Proietti (1997) (4 citations) (Correct)
....understand than the equivalent ones which make use of difference lists. Thus, one may be interested in providing general techniques for transforming in an automatic way programs which use lists, into programs which use difference lists. Several such techniques have been proposed in the literature [15, 31]. We will show that by applying our program synthesis method we can automatically perform the transformation which introduces difference lists. Our method is very general and it can be used also to perform other changes of data representations. The problem of transforming programs which use ....
.... way by using the unfold fold transformations of [28] Some modified versions of the rules should be used instead, like, for instance, the unfold fold rules with constraints introduced by [3] for specializing logic programs, or the inverse definition and the data structure mapping introduced by [31]. Our last example on the avoidance of nondeterminism shows that the unfold fold transformation technique enhanced with our synthesis method, is able to derive programs for which other methods require the off line proof of some insightful lemmas (like the schema based equivalence in [5] By ....
J. Zhang. An automatic d--list transformation algorithm for Prolog programs. Technical report, Department of Computer Science, University College of Swansea, U.K., 1987.
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