Partial evaluation in logic programming
- 30 November 1991
- journal article
- Published by Elsevier BV in The Journal of Logic Programming
- Vol. 11 (3-4), 217-242
- https://doi.org/10.1016/0743-1066(91)90027-m
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Unsolvable problems for SLDNF resolutionThe Journal of Logic Programming, 1991
- Properties of a Pruning OperatorJournal of Logic and Computation, 1990
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- A completeness theorem for SLDNF resolutionThe Journal of Logic Programming, 1989
- Mix: A self-applicable partial evaluator for experiments in compiler generationHigher-Order and Symbolic Computation, 1989
- Mixed computation of Prolog programsNew Generation Computing, 1988
- A self-applicable partial evaluator and its use in incremental compilationNew Generation Computing, 1988
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumptionThe Journal of Logic Programming, 1984
- Mixed computation: potential applications and problems for studyTheoretical Computer Science, 1982
- A partial evaluator, and its use as a programming toolArtificial Intelligence, 1977