A study on the practicality of poly-controlled partial evaluation
From MaRDI portal
Recommendations
- Oracle-based partial evaluation
- Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency
- Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs
- scientific article; zbMATH DE number 1222408
- An improved reductant calculus using fuzzy partial evaluation techniques
Cites work
- A general criterion for avoiding infinite unfolding during partial deduction
- A study on the practicality of poly-controlled partial evaluation
- Automatic finite unfolding using well-founded measures
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 25188 (Why is no real title available?)
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Logic program specialisation through partial deduction: Control issues
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- Partial evaluation in logic programming
Cited in
(2)
This page was built for publication: A study on the practicality of poly-controlled partial evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873793)