Sound and complete partial deduction with unfolding based on well-founded measures
- 3 January 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 122 (1-2) , 97-117
- https://doi.org/10.1016/0304-3975(94)90203-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A general criterion for avoiding infinite unfolding during partial deductionNew Generation Computing, 1992
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- A transformational approach to negation in logic programmingThe Journal of Logic Programming, 1990
- Metainterpreters for expert system constructionThe Journal of Logic Programming, 1989
- Partial evaluation of metaprograms in a “multiple worlds” logic languageNew Generation Computing, 1988
- A partial evaluation system for Prolog: some practical considerationsNew Generation Computing, 1988