Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs
Authors:
- 18 November 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 168-188
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Constrained partial deduction and the preservation of characteristic treesNew Generation Computing, 1998
- A roadmap to metacomputation by supercompilation1996
- Narrowing-driven partial evaluation of functional logic programsLecture Notes in Computer Science, 1996
- A positive supercompilerJournal of Functional Programming, 1996
- Partial deduction and driving are equivalentLecture Notes in Computer Science, 1994
- Towards unifying partial evaluation, deforestation, supercompilation, and GPCLecture Notes in Computer Science, 1994
- Occam's razor in metacomputation: the notion of a perfect process treeLecture Notes in Computer Science, 1993
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- Deforestation: transforming programs to eliminate treesTheoretical Computer Science, 1990
- The concept of a supercompilerACM Transactions on Programming Languages and Systems, 1986