Compiling control

DOI10.1016/0743-1066(89)90033-2zbMath0668.68025OpenAlexW2914613462MaRDI QIDQ3821563

Danny De Schreye, Bruno Krekels, Maurice Bruynooghe

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

correctnessPROLOGmachine learningprogram synthesiscompilingautomated systemControl languagesefficient execution of programsmanual transformation technique

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

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