Pages that link to "Item:Q673496"

The following pages link to Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496):

Displaying 10 items.

• Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification (Q2629858) (← links)
• Extra Variables Can Be Eliminated from Functional Logic Programs (Q2867956) (← links)
• Transformations of logic programs on infinite lists (Q3585155) (← links)
• Solving Horn Clauses on Inductive Data Types Without Induction (Q4559806) (← links)
• Productive corecursion in logic programming (Q4592714) (← links)
• (Q5015370) (← links)
• (Q5020652) (← links)
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (Q5504662) (← links)
• Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)