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

DOI10.1016/0304-3975(94)00227-AzbMath0873.68023OpenAlexW2029186912MaRDI QIDQ673496

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)

Related Items (10)

Synthesis of positive logic programs for checking a class of definitions with infinite quantification ⋮ Solving Horn Clauses on Inductive Data Types Without Induction ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Productive corecursion in logic programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Transformations of logic programs on infinite lists ⋮ A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs ⋮ Extra Variables Can Be Eliminated from Functional Logic Programs ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism

Cites Work

• Deforestation: Transforming programs to eliminate trees
• Preservation of stronger equivalence in unfold/fold logic program transformation
• Mechanizing structural induction. II: Strategies
• A general criterion for avoiding infinite unfolding during partial deduction
• Compiling control
• Derivation of Logic Programs
• Partial evaluation in logic programming
• Proving Theorems about LISP Functions
• A Transformation System for Developing Recursive Programs
• Horn clause computability
• Basic transformation operations which preserve computed answer substitutions of logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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