A general criterion for avoiding infinite unfolding during partial deduction

DOI10.1007/BF03037527zbMath0782.68024MaRDI QIDQ1205178

Bern Martens, Danny De Schreye, Maurice Bruynooghe

Publication date: 1 April 1993

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

zbMATH Keywords

terminationpartial deduction

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (10)

Rules + strategies for transforming lazy functional logic programs ⋮ A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs ⋮ Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs ⋮ A framework for computing finite SLD trees ⋮ The narrowing-driven approach to functional logic program specialization ⋮ Loop checks for logic programs with functions ⋮ Test Data Generation of Bytecode by CLP Partial Evaluation ⋮ Termination prediction for general logic programs ⋮ Sound and complete partial deduction with unfolding based on well-founded measures ⋮ A Study on the Practicality of Poly-Controlled Partial Evaluation

Cites Work

• Termination of rewriting
• Partial evaluation of metaprograms in a ``multiple worlds logic language
• A self-applicable partial evaluator and its use in incremental compilation
• On the transformation of logic programs with instantiation based computation rules
• Termination proofs for logic programs
• Compiling control
• Proving termination with multiset orderings
• Partial evaluation in logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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