Sound and complete partial deduction with unfolding based on well-founded measures

DOI10.1016/0304-3975(94)90203-8zbMath0801.68026OpenAlexW2008662807MaRDI QIDQ1314419

Danny De Schreye, Bern Martens, Tamás L. Horváth

Publication date: 8 December 1994

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

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

zbMATH Keywords

logic programspartial deductionautomatic unfolding algorithmSLD- trees

Mathematics Subject Classification ID

Logic programming (68N17) General topics in the theory of software (68N01)

Related Items (2)

Abstract conjunctive partial deduction for the analysis and compilation of coroutines ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism

Cites Work

• Partial evaluation of metaprograms in a ``multiple worlds logic language
• A general criterion for avoiding infinite unfolding during partial deduction
• Partial evaluation in logic programming
• Supporting Transformations for the Partial Evaluation of Logic Programs
• A transformational approach to negation in logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sound and complete partial deduction with unfolding based on well-founded measures