A method for specializing logic programs
- 1 April 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 12 (2) , 253-302
- https://doi.org/10.1145/78942.78947
Abstract
A specialization method for logic programs that allows one to restrict a general program to special cases by means of constraint predicates is presented. A set of basic transformation operations, which are shown to produce equivalent programs, is defined. The method uses these operations for propagating the constraint information through the program and for consequently simplifying it whenever possible. Some examples of specializations are given, and some improvements and developments of the method are discussed.Keywords
This publication has 12 references indexed in Scilit:
- Verifying correctness of logic programsPublished by Springer Nature ,1989
- Symbolic evaluation with structural recursive symbolic constantsScience of Computer Programming, 1987
- An experiment in partial evaluation: The generation of a compiler generatorLecture Notes in Computer Science, 1985
- Program simplification via symbolic interpretationPublished by Springer Nature ,1985
- Program Transformation SystemsACM Computing Surveys, 1983
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- Derivation of Logic ProgramsJournal of the ACM, 1981
- Negation as FailurePublished by Springer Nature ,1978
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976