Abstract
This paper presents an application of higher-order logic programming: program schemata and schema-based transformations of logic programs. We are constructing higher-order programs that can unify logic programs with suitable program schemata, which are also higher-order constructs. They are abstracting out common recursive control flow patterns, and we can think about logic programs as about instances of certain program schemata. We use λProlog, because it can serve both as the language of logic programs and as the meta-language of program schemata.
The full version of the paper can be found at http://ktiml.ms.mff.cuni.cz/~olmer
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olmer, P., Štěpánek, P. (2002). Schema-Based Transformations of Logic Programs in λProlog. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_36
Download citation
DOI: https://doi.org/10.1007/3-540-45619-8_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43930-1
Online ISBN: 978-3-540-45619-3
eBook Packages: Springer Book Archive