A general criterion for avoiding infinite unfolding during partial deduction

DOI10.1007/BF03037527MaRDI QIDQ1205178zbMATH OpenFDO

Authors Maurice Bruynooghe, Danny De Schreye, Bern Martens

Publication date 1 April 1993

Published in New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

partial deductiontermination

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Sound and complete partial deduction with unfolding based on well-founded measures
• Automatic finite unfolding using well-founded measures
• scientific article; zbMATH DE number 970704
• Loop checking in partial deduction
• Efficient local unfolding with ancestor stacks

Cites work

• scientific article; zbMATH DE number 3978352 (Why is no real title available?)
• scientific article; zbMATH DE number 4096803 (Why is no real title available?)
• scientific article; zbMATH DE number 46359 (Why is no real title available?)
• scientific article; zbMATH DE number 549972 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 970704 (Why is no real title available?)
• scientific article; zbMATH DE number 970705 (Why is no real title available?)
• A self-applicable partial evaluator and its use in incremental compilation
• Compiling control
• On the transformation of logic programs with instantiation based computation rules
• Partial evaluation in logic programming
• Partial evaluation of metaprograms in a ``multiple worlds logic language
• Proving termination with multiset orderings
• Termination of rewriting
• Termination proofs for logic programs

Cited in

(11)

• Test Data Generation of Bytecode by CLP Partial Evaluation
• Rules + strategies for transforming lazy functional logic programs
• scientific article; zbMATH DE number 970704 (Why is no real title available?)
• A hybrid approach to conjunctive partial evaluation of logic programs
• A framework for computing finite SLD trees
• Sound and complete partial deduction with unfolding based on well-founded measures
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
• Loop checks for logic programs with functions
• The narrowing-driven approach to functional logic program specialization
• A study on the practicality of poly-controlled partial evaluation
• Termination prediction for general logic programs

This page was built for publication: A general criterion for avoiding infinite unfolding during partial deduction

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