Supporting Transformations for the Partial Evaluation of Logic Programs
From MaRDI portal
Recommendations
- Partial evaluation in logic programming
- Basic transformation operations which preserve computed answer substitutions of logic programs
- Publication:4944882
- Transformations of logic programs with goals as arguments
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
Cited in
(17)- An improved reductant calculus using fuzzy partial evaluation techniques
- Partial evaluation of metaprograms in a ``multiple worlds logic language
- Sound and complete partial deduction with unfolding based on well-founded measures
- Specialization of inductively sequential functional logic programs
- Efficient local unfolding with ancestor stacks
- scientific article; zbMATH DE number 440117 (Why is no real title available?)
- Partial evaluation in logic programming
- Logic program specialisation through partial deduction: Control issues
- scientific article; zbMATH DE number 2079865 (Why is no real title available?)
- Speedup of logic programs by binarization and partial deduction
- scientific article; zbMATH DE number 1420811 (Why is no real title available?)
- scientific article; zbMATH DE number 1420816 (Why is no real title available?)
- Basic transformation operations which preserve computed answer substitutions of logic programs
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- Functional and Logic Programming
- Oracle-based partial evaluation
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
This page was built for publication: Supporting Transformations for the Partial Evaluation of Logic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286220)