A general criterion for avoiding infinite unfolding during partial deduction
- 1 March 1992
- journal article
- research article
- Published by Springer Nature in New Generation Computing
- Vol. 11 (1) , 47-79
- https://doi.org/10.1007/bf03037527
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- Studies in Pure Prolog: TerminationPublished by Springer Nature ,1990
- Metainterpreters for expert system constructionThe Journal of Logic Programming, 1989
- Compiling controlThe Journal of Logic Programming, 1989
- Mix: A self-applicable partial evaluator for experiments in compiler generationHigher-Order and Symbolic Computation, 1989
- On the transformation of logic programs with instantiation based computation rulesJournal of Symbolic Computation, 1989
- The limitations of partial evaluationPublished by Springer Nature ,1989
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- Proving termination with multiset orderingsCommunications of the ACM, 1979