A Study on the Practicality of Poly-Controlled Partial Evaluation

DOI10.1016/j.entcs.2007.01.008zbMath1279.68043OpenAlexW2098631843MaRDI QIDQ2873793

Claudio Ochoa, Germán Puebla

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.01.008

zbMATH Keywords

partial evaluationcontrol strategiesprogram optimizationpruning techniquesresource awareness

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (1)

A Study on the Practicality of Poly-Controlled Partial Evaluation

Uses Software

• ECCE
• Ciao
• CiaoPP

Cites Work

• Unnamed Item
• Unnamed Item
• A general criterion for avoiding infinite unfolding during partial deduction
• Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
• A Study on the Practicality of Poly-Controlled Partial Evaluation
• Automatic finite unfolding using well-founded measures
• Partial evaluation in logic programming
• Logic program specialisation through partial deduction: Control issues
• Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
• Efficient Local Unfolding with Ancestor Stacks for Full Prolog

This page was built for publication: A Study on the Practicality of Poly-Controlled Partial Evaluation