Equivalence-preserving first-order unfold/fold transformation systems
- 1 October 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 105 (1) , 57-84
- https://doi.org/10.1016/0304-3975(92)90287-p
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Strict completion of Logic ProgramsNew Generation Computing, 1991
- A transformational approach to negation in logic programmingThe Journal of Logic Programming, 1990
- A completeness theorem for SLDNF resolutionThe Journal of Logic Programming, 1989
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- Equational problems anddisunificationJournal of Symbolic Computation, 1989
- Negation in logic programmingThe Journal of Logic Programming, 1987
- Making prolog more expressiveThe Journal of Logic Programming, 1984
- The recursion-theoretic complexity of the semantics of predicate logic as a programming languageInformation and Control, 1982
- Derivation of Logic ProgramsJournal of the ACM, 1981
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977