Representing Logic Program Schemata in Prolog (1995)
| Venue: | Proceedings of the Twelfth International Conference on Logic Programming |
| Citations: | 13 - 2 self |
BibTeX
@INPROCEEDINGS{Gegg-harrison95representinglogic,
author = {Timothy S. Gegg-harrison},
title = {Representing Logic Program Schemata in Prolog},
booktitle = {Proceedings of the Twelfth International Conference on Logic Programming},
year = {1995},
pages = {467--481},
publisher = {MIT Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Program schemata and programming techniques provide a mechanism for representing the essential characteristics of logic programs. By abstracting out common recursive control flow patterns, program schemata capture large classes of logic programs. Programming techniques represent common program components. By instantiating portions of program schemata with programming techniques, it is possible to generate arbitrary logic programs. In order to represent program schemata and programming techniques for any programming language, it is desirable to use a higher-order programming language as the representation language. �Prolog is a higher-order logic programming language that extends Prolog by incorporating higher-order unification and �-terms, making it an ideal logic programming language for representing logic program schemata and programming techniques. Because �Prolog program schemata and programming techniques can be represented in �Prolog, there is no need for the creation of an abstract meta-language in order to define and classify logic program schemata and programming techniques. 1
