Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 115-132
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Program Transformation for Backwards Analysis of Logic ProgramsLecture Notes in Computer Science, 2004
- Logic program specialisation through partial deduction: Control issuesTheory and Practice of Logic Programming, 2002
- An Assertion Language for Constraint Logic Programs2000
- On the Power of Homeomorphic Embedding for Online Termination1998
- Partial evaluation of the “real thing”Lecture Notes in Computer Science, 1994
- Mixtus: An automatic partial evaluator for full PrologNew Generation Computing, 1993
- An introduction to partial deductionLecture Notes in Computer Science, 1992
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- A partial evaluation system for Prolog: some practical considerationsNew Generation Computing, 1988
- Foundations of Logic Programming1987