Compiling control

DOI10.1016/0743-1066(89)90033-2MaRDI QIDQ3821563zbMATH OpenOpenAlexFDO

Authors Maurice Bruynooghe, Danny De Schreye, Bruno Krekels

Publication date 1989

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

Full work available at URL https://lirias.kuleuven.be/handle/123456789/124761

zbMATH Keywords

machine learningcorrectnessprogram synthesisPROLOGcompilingautomated systemControl languagesefficient execution of programsmanual transformation technique

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Automating control for logic programs
• Control generation by program transformation
• Compiling bottom-up and mixed derivations into top-down executable logic programs
• Some global optimizations for a PROLOG compiler
• scientific article; zbMATH DE number 512886

Cited in

(11)

• Automating control for logic programs
• A general criterion for avoiding infinite unfolding during partial deduction
• Speeding up inferences using relevance reasoning: a formalism and algorithms
• From Logic to Functional Logic Programs
• Fast Frequent Querying with Lazy Control Flow Compilation
• Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
• Compiling control as offline partial deduction
• Abstract conjunctive partial deduction for the analysis and compilation of coroutines
• Compiling bottom-up and mixed derivations into top-down executable logic programs
• On the transformation of logic programs with instantiation based computation rules
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs

This page was built for publication: Compiling control

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