The loop absorption and the generalization strategies for the development of logic programs and partial deduction
- 31 May 1993
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 16 (1-2) , 123-161
- https://doi.org/10.1016/0743-1066(93)90025-c
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Basic transformation operations which preserve computed answer substitutions of logic programsThe Journal of Logic Programming, 1993
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- Preservation of stronger equivalence in unfold/fold logic program transformationTheoretical Computer Science, 1990
- Synthesis of eureka predicates for developing logic programsPublished by Springer Nature ,1990
- Compiling controlThe Journal of Logic Programming, 1989
- Unfold/fold transformations and loop optimization of logic programsACM SIGPLAN Notices, 1988
- Derivation of Logic ProgramsJournal of the ACM, 1981
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjectureTransactions of the American Mathematical Society, 1960
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952