Pages that link to "Item:Q1205178"
From MaRDI portal
The following pages link to A general criterion for avoiding infinite unfolding during partial deduction (Q1205178):
Displaying 10 items.
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- A Study on the Practicality of Poly-Controlled Partial Evaluation (Q2873793) (← links)
- A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (Q3003494) (← links)
- Test Data Generation of Bytecode by CLP Partial Evaluation (Q3617426) (← links)
- Termination prediction for general logic programs (Q3648357) (← links)
- The narrowing-driven approach to functional logic program specialization (Q5957056) (← links)
- Loop checks for logic programs with functions (Q5958765) (← links)
