Compiling associativity into logic programs

DOI10.1016/0743-1066(87)90010-0MaRDI QIDQ3768370zbMATH OpenOpenAlexFDO

Authors D. R. Brough, Christopher J. Hogger

Publication date 1987

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(87)90010-0

zbMATH Keywords

correctnessefficiencyrecursive logic programstail recursiontransformation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3907751
• Transformations of logic programs
• Transformations of logic programs with goals as arguments
• scientific article; zbMATH DE number 440117
• scientific article; zbMATH DE number 1534593

Cited in

(5)

• scientific article; zbMATH DE number 1615259 (Why is no real title available?)
• scientific article; zbMATH DE number 3907751 (Why is no real title available?)
• Difference-list transformation for Prolog
• The list introduction strategy for the derivation of logic programs
• Grammar-related transformations of logic programs

This page was built for publication: Compiling associativity into logic programs

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