Generalised logic program transformation schemas
Date
1998-07Source Title
7th International Workshop on Logic Programming Synthesis and Transformation Workshop, LOPSTR’97
Print ISSN
0302-9743
Publisher
Springer
Pages
49 - 68
Language
English
Type
Conference PaperItem Usage Stats
173
views
views
126
downloads
downloads
Abstract
Schema-based logic program transformation has proven to be an eective technique for the optimisation of programs. This paper results from the research that began by investigating the suggestions in [11] to construct a more general database of transformation schemas for optimising logic programs at the declarative level. The proposed transformation schemas fully automate accumulator introduction (also known as descending computational generalisation), tupling generalisation (a special case of structural generalisation), and duality laws (which are extensions to relational programming of the rst duality law of the fold operators in functional programming). The schemas are proven correct. A prototype schema-based transformation system is evaluated. © Springer-Verlag Berlin Heidelberg 1998.
Keywords
Computation theoryFormal logic
Functional programming
Synthesis (chemical)
Generalisation
Logic programs
Optimisations
Transformation systems
Tupling
Logic programming