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

DOI10.1016/0304-3975(94)00227-AzbMATH Open0873.68023OpenAlexW2029186912MaRDI QIDQ673496FDOQ673496

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

Recommendations

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

zbMATH Keywords

logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

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

Cited In (13)

• Title not available (Why is that?)
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
• Title not available (Why is that?)
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• Solving Horn Clauses on Inductive Data Types Without Induction
• A folding rule for eliminating existential variables from constraint logic programs
• Title not available (Why is that?)
• Extra variables can be eliminated from functional logic programs
• Productive corecursion in logic programming
• Transformations of logic programs on infinite lists
• Title not available (Why is that?)
• 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)