Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates

DOI10.1007/11680093_8MaRDI QIDQ5302883zbMATH OpenOpenAlexFDO

Authors Elvira Albert, Germán Puebla, John P. Gallagher

Publication date 15 January 2009

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://rucforsk.ruc.dk/ws/files/264563/albertpueblagallagher.pdf

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Supporting Transformations for the Partial Evaluation of Logic Programs
• Partial evaluation in logic programming
• Partial evaluation of metaprograms in a ``multiple worlds logic language
• Efficient local unfolding with ancestor stacks
• Efficient Local Unfolding with Ancestor Stacks for Full Prolog

Cited in

(6)

• Fast offline partial evaluation of logic programs
• A study on the practicality of poly-controlled partial evaluation
• Test case generation for object-oriented imperative languages in CLP
• Fast Offline Partial Evaluation of Large Logic Programs
• Oracle-based partial evaluation
• Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation

Describes a project that uses

Uses Software

• Ciao
• CiaoPP

This page was built for publication: Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302883)