Logic Program Transformation through Generalization Schemata (1996)
| Venue: | Proc. LOPSTR'95 , pages 171--173. LNCS 1048 |
| Citations: | 12 - 6 self |
BibTeX
@INPROCEEDINGS{Flener96logicprogram,
author = {Pierre Flener and Yves Deville},
title = {Logic Program Transformation through Generalization Schemata},
booktitle = {Proc. LOPSTR'95 , pages 171--173. LNCS 1048},
year = {1996},
pages = {171--173},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In program synthesis, program transformation can be done on the fly, based on information generated and exploited during the program construction process. For instance, some logic program generalization techniques can be pre-compiled at the logic program schema level, yielding transformation schemata that give rise to elimination of the eureka discovery, full automation of the transformation process itself, and even the prediction whether and which optimizations will be achieved. 1 Introduction Programs can be classified according to their construction methodologies, such as divide-and-conquer, generate -and-test, top-down decomposition, global search, and so on, or any composition thereof. Informally, a program schema is a template program with a fixed control and data flow, but without specific indications about the actual parameters or the actual computations, except that they must satisfy certain constraints. A program schema thus abstracts a whole family of particular programs th...
Citations
No citations identified.
