Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs

DOI10.1016/0304-3975(94)00227-AMaRDI QIDQ673496zbMATH OpenOpenAlexFDO

Authors Maurizio Proietti, Alberto Pettorossi

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00227-a

zbMATH Keywords

logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 549961
• scientific article; zbMATH DE number 440117
• Unfold/fold transformations of logic programs

Cites work

• A general criterion for avoiding infinite unfolding during partial deduction
• A Transformation System for Developing Recursive Programs
• Basic transformation operations which preserve computed answer substitutions of logic programs
• Compiling control
• Deforestation: Transforming programs to eliminate trees
• Derivation of Logic Programs
• Horn clause computability
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3765107 (Why is no real title available?)
• scientific article; zbMATH DE number 177791 (Why is no real title available?)
• Mechanizing structural induction. II: Strategies
• Partial evaluation in logic programming
• Preservation of stronger equivalence in unfold/fold logic program transformation
• Proving Theorems about LISP Functions

Cited in

(14)

• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• Extra variables can be eliminated from functional logic programs
• scientific article; zbMATH DE number 440117 (Why is no real title available?)
• A folding rule for eliminating existential variables from constraint logic programs
• scientific article; zbMATH DE number 4164123 (Why is no real title available?)
• Transformations of logic programs on infinite lists
• scientific article; zbMATH DE number 549961 (Why is no real title available?)
• Solving Horn clauses on inductive data types without induction
• Productive corecursion in logic programming
• Removing unnecessary variables from Horn clause verification conditions
• scientific article; zbMATH DE number 7453193 (Why is no real title available?)
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• Derivation of efficient logic programs by specialization and reduction of nondeterminism

This page was built for publication: Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs

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